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 A226905 #8 Jun 21 2013 18:47:19
%S A226905 11593,206953,315257,373649,373657,495377,495389,509389,509393,541097,
%T A226905 612109,612113,766261,766273,766277,789097,789101,906541,992393,
%U A226905 1124993,1330229,1330237,1410361,1531633,1531657,1531661,1578133,1578169,1595081,1694897,1694909
%N A226905 First in a sequence of 9 consecutive primes all of the form 4n+1.
%D A226905 David Wells, The Penguin Dictionary of Curious and Interesting Numbers (Rev. ed. 1997), p. 163 (entry for 11593).
%e A226905 206953, 206993, 207013, 207017, 207029, 207037, 207041, 207061, and 207073 are 9 consecutive primes, each equal to 1 mod 4.
%t A226905 Transpose[Select[Partition[Prime[Range[180000]],9,1],Union[Mod[#,4]] == {1}&]][[1]]
%Y A226905 Cf. A055623 (first occurrence of run of primes congruent to 1 mod 4 of exactly length n).
%K A226905 nonn
%O A226905 1,1
%A A226905 _Harvey P. Dale_, Jun 21 2013