This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A287293 #23 Dec 09 2018 06:44:44 %S A287293 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 A287293 64,64,64,128,128,128,128,128,128,128,128,256,256,256,256,256,256,256, %U A287293 256,512,512,512,512,512,512,512,512,512,512,512,512,512,512,512 %N A287293 Golomb's sequence with powers of 2. %C A287293 A Golomb-type sequence over the powers of 2 (A000079) instead of the integers. %H A287293 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 A287293 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 A287293 (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 A287293 Like A001462, but instead of integers, uses powers of 2. The terms without repetition are A000079. %K A287293 nonn,easy %O A287293 1,1 %A A287293 _Matthew Schulz_, May 22 2017