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 A142014 #18 May 14 2023 13:29:01 %S A142014 41,103,227,599,661,971,1033,1777,1901,2087,2273,2459,2521,2707,3079, %T A142014 3203,3389,3637,3761,3823,3947,4133,4567,4691,4877,5683,5807,5869, %U A142014 6427,6551,6737,7109,7481,7853,8039,8101,8287,8597,8783,8969,9341,9403,10271,10333 %N A142014 Primes congruent to 10 mod 31. %H A142014 Vincenzo Librandi, <a href="/A142014/b142014.txt">Table of n, a(n) for n = 1..1000</a> %F A142014 a(n) ~ 30n log n. - _Charles R Greathouse IV_, Jul 03 2016 %t A142014 Select[Range[10,20000,31],PrimeQ] (* _Vladimir Joseph Stephan Orlovsky_, Apr 20 2011 *) %t A142014 Select[Prime[Range[1300]],Mod[#,31]==10&] (* _Harvey P. Dale_, May 14 2023 *) %o A142014 (Magma) [ p: p in PrimesUpTo(30000) | p mod 31 eq 10 ]; // _Vincenzo Librandi_, Apr 20 2011 %o A142014 (PARI) is(n)=isprime(n) && n%31==10 \\ _Charles R Greathouse IV_, Jul 03 2016 %Y A142014 Cf. A000040, A142005, A142006. %K A142014 nonn,easy %O A142014 1,1 %A A142014 _N. J. A. Sloane_, Jul 11 2008