A079251 Complement of A079000.

2, 3, 5, 10, 12, 14, 22, 24, 26, 28, 30, 32, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130, 132, 134, 136, 138, 140, 190, 192, 194, 196, 198, 200, 202, 204

Offset: 1

Author

N. J. A. Sloane, Feb 04 2003

Keywords

• nonn

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

Programs

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 *)

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 */

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