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 A092640 #10 Mar 18 2018 17:27:41 %S A092640 0,5,20,101,751,5949,49010,418366,3627049,32067600,287357618 %N A092640 Number of consecutive prime runs of 2 primes congruent to 3 mod 4 below 10^n. %F A092640 Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 2 primes occur before interruption by a prime congruent to 1 mod 4. %e A092640 a(4)=101 because 101 pairs of primes occur below 10^4, each run interrupted by a prime congruent to 1 mod 4. %Y A092640 Cf. A092640, A092641. %K A092640 more,nonn %O A092640 1,2 %A A092640 _Enoch Haga_, Mar 02 2004 %E A092640 a(9)-a(11) from _Chai Wah Wu_, Mar 18 2018