OFFSET
1,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..20000
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, arXiv:math/0305308 [math.NT], 2003.
Ralf Stephan, Some divide-and-conquer sequences ...
Ralf Stephan, Table of generating functions
FORMULA
a(n)=b(n-1)+2, with b(0)=0, b(2n)=2b(n)+1+3[n>1], b(2n+1)=2b(n)+1+5[n>0]. - Ralf Stephan, Oct 07 2003
MATHEMATICA
nmax = 150; b[1] = 1; b[n_] := Module[{k, j}, k = Floor[Log[2, (n+3)/6]]; j = n - 9*2^k + 3; 12*2^k - 3 + 3j/2 + Abs[j]/2];
Complement[Range[b[nmax]], Array[b, nmax]] (* Jean-François Alcover, Nov 28 2018 *)
PROG
(PARI) a(n)=if(n<3, if(n<2, 2, 3), 3*2^floor(log(2/3*(n-1))/log(2))+2*n-4) /* Ralf Stephan */
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 04 2003
STATUS
approved