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 A061237 #30 May 14 2025 14:55:41
%S A061237 19,37,73,109,127,163,181,199,271,307,379,397,433,487,523,541,577,613,
%T A061237 631,739,757,811,829,883,919,937,991,1009,1063,1117,1153,1171,1279,
%U A061237 1297,1423,1459,1531,1549,1567,1621,1657,1693,1747,1783,1801,1873,1999
%N A061237 Prime numbers == 1 (mod 9).
%H A061237 Harry J. Smith, <a href="/A061237/b061237.txt">Table of n, a(n) for n = 1..2000</a>
%F A061237 A010888(a(n)) = 1. - _Reinhard Zumkeller_, Feb 25 2005
%F A061237 a(n) ~ 6n log n. - _Charles R Greathouse IV_, May 14 2025
%t A061237 Select[ Range[ 2000 ], PrimeQ[ # ] && Mod[ #, 9 ] == 1 & ]
%t A061237 Select[Prime[Range[350]],Mod[#,9]==1&] (* _Harvey P. Dale_, Jan 06 2013 *)
%o A061237 (PARI) isok(p) = { isprime(p) && p%9 == 1 } \\ _Harry J. Smith_, Jul 19 2009
%o A061237 (Magma) [ p: p in PrimesUpTo(2000) | p mod 9 in {1} ]; // _Vincenzo Librandi_, Dec 25 2010
%Y A061237 Cf. A010888, A061238, A061239, A061240, A061241, A061242.
%K A061237 nonn,easy
%O A061237 1,1
%A A061237 _Amarnath Murthy_, Apr 23 2001
%E A061237 More terms from _Robert G. Wilson v_, May 10 2001