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 A330360 #14 May 10 2020 19:32:54 %S A330360 1,9,285,933,741,11173,15109,33705,100737,24025,34197,86829,5370693, %T A330360 6457761,2287341,26529033,53099457,770289,754577025,256655365, %U A330360 765951429,2618761237,1075872265,2405972445,2767592133 %N A330360 First occurrence of run of lucky numbers congruent to 1 mod 4 of exactly length n. %C A330360 Calculated using _Hugo van der Sanden_'s Lucky numbers up to 10^9 (private communication). %C A330360 a(20) = 256655365. %C A330360 a(26) > 4*10^9. - _Giovanni Resta_, May 10 2020 %H A330360 Amiram Eldar and Giovanni Resta, <a href="/A330360/a330360_1.txt">Table of n, k, A000959(k),... A000959(k+n-1) for n=1..25</a> %e A330360 a(1) = 1 since 1 is the first lucky number congruent to 1 mod 4, and the next lucky number is 3 which is not congruent to 1 mod 4. %e A330360 a(2) = 9 since 9 and 13 are 2 consecutive lucky numbers congruent to 1 mod 4, following 7 and followed by 15 which are both not congruent to 1 mod 4. %Y A330360 Cf. A000959, A055623, A137168, A330359, A330361. %K A330360 nonn,more %O A330360 1,2 %A A330360 _Amiram Eldar_, Dec 12 2019 %E A330360 a(19)-a(25) from _Giovanni Resta_, May 10 2020