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 A293668 #20 Sep 30 2018 10:42:53
%S A293668 1,2,3,1,4,1,1,1,2,1,1,1,1,1,1,1,5,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,
%T A293668 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,
%U A293668 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
%N A293668 First differences of A292046.
%C A293668 a(n) is also the length of n-th run of consecutive integers in the complement of A292046, starting from the 1st run "4, 5".
%C A293668 This sequence is invariant under the following transform: subtract 1 from every term, eliminate zeros. Other sequences with this property include A001511 and other generalized ruler functions, A002260, A272729.
%H A293668 Antti Karttunen, <a href="/A293668/b293668.txt">Table of n, a(n) for n = 0..65537</a>
%F A293668 a(0) = 1, a(n) = A292046(n+1)-A292046(n) for n>0.
%F A293668 If n = 2^k, a(n) = a(k)+1; otherwise a(n) = 1.
%F A293668 a(n) = A255308(n) + 1.
%F A293668 a(n) = O(log*(n)), where log* is the iterated logarithm. More precisely, a(n) <= A230864(n+1)+1.
%o A293668 (PARI) A293668(n) = { my(k=1); while(n && !bitand(n,n-1),n = valuation(n,2); k++); (k); }; \\ _Antti Karttunen_, Sep 30 2018
%Y A293668 Cf. A001511, A002260, A230864, A255308, A272729, A292046.
%K A293668 nonn,easy
%O A293668 0,2
%A A293668 _Andrey Zabolotskiy_, Oct 14 2017