A287293 Golomb's sequence with powers of 2.

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

Offset

1,1

Comments

A Golomb-type sequence over the powers of 2 (A000079) instead of the integers.

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000 (first 108 terms from Matthew Schulz)

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.

Sequence in context: A120541 A190172 A339820 * A059867 A359182 A046971

Adjacent sequences: A287290 A287291 A287292 * A287294 A287295 A287296

Keyword

nonn,easy

Author

Matthew Schulz, May 22 2017

Status

approved