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 A092664 #16 Oct 15 2024 23:16:42 %S A092664 0,0,0,0,0,3,23,337,3605,38037,380962,3799462,37594962 %N A092664 Number of consecutive prime runs of 10 primes congruent to 3 mod 4 below 10^n. %H A092664 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/A092663%2B4%2B5.py">Python program</a>. %F A092664 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 1 mod 4 %e A092664 a(6)=3 because 3 sets of 10 primes occur below 10^6, each run interrupted by a prime congruent to 1 mod 4. %Y A092664 Cf. A092663 A092665. %K A092664 more,nonn,hard %O A092664 1,6 %A A092664 _Enoch Haga_, Mar 02 2004 %E A092664 a(9) and a(10) from _Sean A. Irvine_, Oct 06 2011 %E A092664 a(11) from _Chai Wah Wu_, Mar 18 2018 %E A092664 a(12) and a(13) from _Lucas A. Brown_, Oct 15 2024