|
Search: id:A079251
|
|
| |
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
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 (math.NT/0305308)
R. Stephan, Some divide-and-conquer sequences ...
R. 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
|
|
PROGRAM
|
(PARI) a(n)=if(n<3, if(n<2, 2, 3), 3*2^floor(log(2/3*(n-1))/log(2))+2*n-4) (from R. Stephan)
|
|
CROSSREFS
|
Sequence in context: A104427 A002263 A039022 this_sequence A050051 A083571 A123090
Adjacent sequences: A079248 A079249 A079250 this_sequence A079252 A079253 A079254
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Feb 04 2003
|
|
|
Search completed in 0.002 seconds
|
