|
%I #23 Dec 09 2018 06:44:44
%S 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,
%T 64,64,64,128,128,128,128,128,128,128,128,256,256,256,256,256,256,256,
%U 256,512,512,512,512,512,512,512,512,512,512,512,512,512,512,512
%N Golomb's sequence with powers of 2.
%C A Golomb-type sequence over the powers of 2 (A000079) instead of the integers.
%H Rémy Sigrist, <a href="/A287293/b287293.txt">Table of n, a(n) for n = 1..10000</a> (first 108 terms from Matthew Schulz)
%e 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.
%o (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
%Y Like A001462, but instead of integers, uses powers of 2. The terms without repetition are A000079.
%K nonn,easy
%O 1,1
%A _Matthew Schulz_, May 22 2017
|
