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 A092663 #17 Oct 15 2024 23:16:46 %S A092663 0,0,0,0,0,5,19,323,3653,37544,381413,3799344,37591054 %N A092663 Number of consecutive prime runs of 10 primes congruent to 1 mod 4 below 10^n. %H A092663 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/A092663%2B4%2B5.py">Python program</a>. %F A092663 Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 10 primes occur before interruption by a prime congruent to 3 mod 4 %e A092663 a(6)=5 because 5 sets of 10 primes occur below 10^6, each run interrupted by a prime congruent to 3 mod 4. These runs start at prime(31798)=373649, prime(41181)=495377, at prime(42241)=509389, at prime(50017)=612109, *not* at prime(61457) which has a larger run length, and at prime(63146)=789097. %Y A092663 Cf. A092664, A092665, A039702, A100672, A145990. %K A092663 more,nonn,hard %O A092663 1,6 %A A092663 _Enoch Haga_, Mar 02 2004 %E A092663 a(9) and a(10) from _Sean A. Irvine_, Oct 06 2011 %E A092663 a(11) from _Chai Wah Wu_, Mar 18 2018 %E A092663 a(12) and a(13) from _Lucas A. Brown_, Oct 15 2024