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 A256461 #17 Apr 04 2015 09:28:31 %S A256461 1,0,0,1,1,1,1,1,0,1,1,1,4,1,0,1,1,1,18,1,5,0,0,1,1,1,1,1,2,0,1,1,1,1, %T A256461 9,1,1,4,1,4,1,4,0,1,1,1,1,1,16,1,0,1,1,1,7,1,1,9,1,5,0,0,1,1,1,1,2,1, %U A256461 1,1,1,1,1,1,4,4,1,7,0,1,5,1,1,4,3,1 %N A256461 Smallest k such that A098550(n) + A098550(n+1) + ... + A098550(n+k) is prime, or -1 if there is no such k. %C A256461 Conjecture: a(n)>=0 for all n. %C A256461 In contrast to this conjecture, for the sequence of the positive integers (A=A000027) there are infinitely many n for which A(n) + A(n+1) + ... + A(n+k) is composite for every k>=0 (cf. A089306, A077654). %H A256461 Peter J. C. Moses, <a href="/A256461/b256461.txt">Table of n, a(n) for n = 1..10000</a> %Y A256461 Cf. A098550, A000027, A089306, A077654. %K A256461 nonn %O A256461 1,13 %A A256461 _Vladimir Shevelev_, Mar 30 2015 %E A256461 More terms from _Peter J. C. Moses_, Mar 30 2015