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 A043278 #19 Sep 20 2023 17:56:48 %S A043278 1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,2,1,1,1,2,3,2,2,1,1,2,1,1,1,1,2,2,1,1, %T A043278 1,1,2,1,1,2,2,3,2,1,1,1,2,2,1,1,1,1,2,1,1,1,1,2,1,2,2,2,3,3,2,2,2,1, %U A043278 2,1,1,1,1,2,1,1,1,1,2,2,2,2,2,3,4,3,3,2,2,2 %N A043278 Maximal run length in base 4 representation of n. %C A043278 Sequences A031942 (or A043090), A037977, A037978, A037979 list numbers for which a(n)=1, a(n)=2, a(n)=3, a(n)=4. - _M. F. Hasler_, Jul 23 2013 %H A043278 Winston de Greef, <a href="/A043278/b043278.txt">Table of n, a(n) for n = 1..10000</a> %p A043278 mRunLen := proc(L) %p A043278 if nops(L) = 0 then %p A043278 0; %p A043278 else %p A043278 a := 1 ; %p A043278 for i from 2 to nops(L) do %p A043278 if op(i,L) = op(i-1,L) then %p A043278 a := a+1 ; %p A043278 else %p A043278 a := max(a, procname([op(i..nops(L),L)])) ; %p A043278 break; %p A043278 end if; %p A043278 end do: %p A043278 a ; %p A043278 end if ; %p A043278 end proc: %p A043278 A043278 := proc(n) %p A043278 convert(n,base,4) ; %p A043278 mRunLen(%) ; %p A043278 end proc: # _R. J. Mathar_, Jul 26 2015 %t A043278 Table[Max[Length/@Split[IntegerDigits[n,4]]],{n,100}] (* _Harvey P. Dale_, Jan 21 2014 *) %o A043278 (PARI) A043278(n, b=4)={my(m,c=1); while(n>0, n%b==(n\=b)%b && c++ && next; m=max(m, c); c=1); m} \\ _M. F. Hasler_, Jul 23 2013 %Y A043278 Cf. A043276-A043290 for base-2 to base-16 analogs. %K A043278 nonn,base %O A043278 1,5 %A A043278 _Clark Kimberling_