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 A110968 #15 Mar 22 2020 21:17:57 %S A110968 1,14,20,33,54,1025,90,513,140,536870913,200,144115188075855860,294, %T A110968 65522,1832,8193,1070,147573952589676412910,888,524289,1130, %U A110968 549755813889,4178,17179869185,2478,16385,2972,131073,1332,34359738338,5592,18014398509481952,8468 %N A110968 a(n) is the starting position of the first run of n ones in A014963. %C A110968 Probably a(n) exists for every n in N. %C A110968 If n = 2*k, then a(n) - 1 or a(n) + n is of the form 2^e. - _Jinyuan Wang_, Mar 21 2020 %H A110968 Franz Vrabec, <a href="/A110968/b110968.txt">Table of n, a(n) for n = 1..250</a> %e A110968 a(3) = 20 because the first run of 3 ones in A014963 begins at position 20. %o A110968 (PARI) a(n) = if(n%2, my(c=0); for(k=1, oo, if(isprimepower(k), if(c==n, return(k-n), c=0), c++)), my(m=1); for(k=1, oo, m*=2; if(isprimepower(m-n-1) && sum(i=m-n, m-1, isprimepower(i))==0, return(m-n)); if(isprimepower(m+n+1) && sum(i=m+1, m+n, isprimepower(i))==0, return(m+1)))); \\ _Jinyuan Wang_, Mar 21 2020 %Y A110968 Cf. A014963. %K A110968 nonn %O A110968 1,2 %A A110968 _Franz Vrabec_, Sep 27 2005