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 A061241 #29 May 14 2025 14:54:48 %S A061241 7,43,61,79,97,151,223,241,277,313,331,349,367,421,439,457,547,601, %T A061241 619,673,691,709,727,853,907,997,1033,1051,1069,1087,1123,1213,1231, %U A061241 1249,1303,1321,1429,1447,1483,1609,1627,1663,1699,1753,1789,1861,1879,1933 %N A061241 Prime numbers == 7 (mod 9). %C A061241 A010888(a(n)) = 7. - _Reinhard Zumkeller_, Feb 25 2005 %H A061241 Robert Israel, <a href="/A061241/b061241.txt">Table of n, a(n) for n = 1..10000</a> %F A061241 a(n) ~ 6n log n. - _Charles R Greathouse IV_, May 14 2025 %p A061241 select(isprime,[seq(9*i+7,i=0..10^5)]); # _Robert Israel_, Apr 20 2014 %t A061241 Select[Range[2500], PrimeQ[#] && Mod[#, 9] == 7 &] %t A061241 Select[Prime[Range[300]], Mod[#, 9] == 7 & ] (* _Harvey P. Dale_, Apr 30 2011 *) %o A061241 (Magma) [p: p in PrimesUpTo(2000) | p mod 9 eq 7]; // _Vincenzo Librandi_, Dec 25 2010 %o A061241 (PARI) select(n->n%9==7, primes(400)) \\ _Charles R Greathouse IV_, May 27 2014 %Y A061241 Cf. A061237..A061242. %K A061241 nonn,easy %O A061241 1,1 %A A061241 _Amarnath Murthy_, Apr 23 2001 %E A061241 More terms from _Robert G. Wilson v_, May 10 2001