|
%I #21 Nov 28 2018 07:59:42
%S 2,3,5,10,12,14,22,24,26,28,30,32,46,48,50,52,54,56,58,60,62,64,66,68,
%T 94,96,98,100,102,104,106,108,110,112,114,116,118,120,122,124,126,128,
%U 130,132,134,136,138,140,190,192,194,196,198,200,202,204
%N Complement of A079000.
%H Alois P. Heinz, <a href="/A079251/b079251.txt">Table of n, a(n) for n = 1..20000</a>
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Cloitre/cloitre2.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="https://arxiv.org/abs/math/0305308">Numerical analogues of Aronson's sequence</a>, arXiv:math/0305308 [math.NT], 2003.
%H Ralf Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences ...</a>
%H Ralf Stephan, <a href="/A079944/a079944.ps">Table of generating functions</a>
%F 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
%t 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];
%t Complement[Range[b[nmax]], Array[b, nmax]] (* _Jean-François Alcover_, Nov 28 2018 *)
%o (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_ */
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Feb 04 2003
|
