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 A091460 #12 Sep 10 2020 03:39:52
%S A091460 1,1,3,2,3,3,4,2,3,3,3,4,5,4,4,2,3,3,3,5,3,3,4,4,5,5,4,4,5,4,4,2,3,3,
%T A091460 3,5,3,3,5,5,3,3,3,4,7,4,4,4,5,5,5,5,7,4,4,4,5,5,4,4,5,4,4,2,3,3,3,5,
%U A091460 3,3,5,5,3,3,3,6,5,7,5,5,3,3,3,6,3,3,4,4,7,7,4,4,8,4,4,4,5,5,5,5,5,7
%N A091460 Greatest size of an arithmetic progression contained as substrings in binary representation of n.
%C A091460 a(n) <= A078822(n);
%C A091460 a(A091461(n))=n and a(m)<>n for m < A091461(n).
%H A091460 Álvar Ibeas, <a href="/A091460/b091460.txt">Table of n, a(n) for n = 0..10000</a>
%H A091460 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%e A091460 n=28->'11100', {0+k*1: 0<=k<a(28)=5}: bbbb0 => bb1bb => bb10b => b11bb => bb100;
%e A091460 n=29->'11101', {1+k*2: 0<=k<a(29)=4}: bbbb1 => b11bb => bb101 => 111bb.
%Y A091460 Cf. A078822, A007088.
%K A091460 nonn,base
%O A091460 0,3
%A A091460 _Reinhard Zumkeller_, Jan 12 2004