|
|
A287293
|
|
Golomb's sequence with powers of 2.
|
|
1
|
|
|
2, 2, 4, 4, 8, 8, 8, 8, 16, 16, 16, 16, 32, 32, 32, 32, 32, 32, 32, 32, 64, 64, 64, 64, 64, 64, 64, 64, 128, 128, 128, 128, 128, 128, 128, 128, 256, 256, 256, 256, 256, 256, 256, 256, 512, 512, 512, 512, 512, 512, 512, 512, 512, 512, 512, 512, 512, 512, 512
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A Golomb-type sequence over the powers of 2 (A000079) instead of the integers.
|
|
LINKS
|
|
|
EXAMPLE
|
a(1) equals 2 so 2 appears twice. The next term is 4 because 2^2 is 4, and it appears twice because a(2)=4.
|
|
PROG
|
(PARI) a = vector(59); a[1] = 2; for (p=1, oo, for (i=1, a[p], print1 (a[j++] = 2^p ", "); if (j==#a, break (2)))) \\ Rémy Sigrist, Dec 09 2018
|
|
CROSSREFS
|
Like A001462, but instead of integers, uses powers of 2. The terms without repetition are A000079.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|