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 A092198 #11 Mar 28 2018 09:32:44
%S A092198 0,1,3,6,44,1471,1472,1473,1474,1475,1476,25185,25187,25188,25189,
%T A092198 25190,25196,25206,25211,25212,25213,25214,25215,25216,25217,25218,
%U A092198 25219,25222,25224,25225,25251,25253,25257,25258,25410,25421,25426,25427
%N A092198 Equal count of primes congruent to 1 mod 4 and 3 mod 4 associated with primes in A007351 (the zero beginning the sequence indicates the prime 2).
%F A092198 Compute the running totals of primes congruent to 1 mod 4 and primes congruent to 3 mod 4. When these totals are equal, include in the sequence.
%e A092198 a(3)=3 because at this point there are 3 primes congruent to 1 mod 4: 5, 13, 17 and 3 primes congruent to 3 mod 4: 3, 7, 11.
%t A092198 Block[{a = 0, b = -1}, Reap[Do[If[Mod[p, 4] == 1, a++, b++]; If[a == b, Sow@ a, 0], {p, Prime@ Range[51000]}]][[-1, -1]]] (* _Michael De Vlieger_, Mar 26 2018 *)
%Y A092198 Cf. A007351.
%K A092198 easy,nonn
%O A092198 1,3
%A A092198 _Enoch Haga_, Feb 24 2004
%E A092198 Typo in data corrected by _Sean Reeves_, Mar 24 2018