|
Search: id:A079256
|
|
|
| A079256 |
|
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a power of 2". |
|
+0
3
|
|
| 1, 2, 5, 6, 8, 16, 17, 32, 33, 34, 35, 36, 37, 38, 39, 64, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 32769, 32770, 32771, 32772, 32773, 32774, 32775, 32776, 32777, 32778
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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)
|
|
CROSSREFS
|
See A079000, A079253, A079254 for similar sequences.
Sequence in context: A019989 A045547 A127143 this_sequence A097685 A136369 A007573
Adjacent sequences: A079253 A079254 A079255 this_sequence A079257 A079258 A079259
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com) and Matthew Vandermast (ghodges14(AT)comcast.net), Feb 04 2003
|
|
|
Search completed in 0.002 seconds
|
