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 A142827 #18 Sep 08 2022 08:45:37
%S A142827 29,151,761,883,1249,1493,2347,2591,2713,2957,3079,3323,4177,4421,
%T A142827 4787,4909,5153,5519,5641,6007,6373,6983,7349,8081,8447,10399,11131,
%U A142827 11497,11863,12107,12473,13327,13693,14303,14669,15401,15767,15889,16987,17231,17597
%N A142827 Primes congruent to 29 mod 61.
%H A142827 Vincenzo Librandi, <a href="/A142827/b142827.txt">Table of n, a(n) for n = 1..1000</a>
%F A142827 a(n) ~ 60n log n. - _Charles R Greathouse IV_, Jul 03 2016
%t A142827 Select[Prime[Range[2100]],Mod[#,61]==29&] (* _Harvey P. Dale_, Mar 30 2011 *)
%t A142827 Select[Range[29,18000,61],PrimeQ] (* _Harvey P. Dale_, Nov 19 2011 *) (* For a larger range of numbers, the second program is faster *)
%t A142827 Select[Prime[Range[2300]], MemberQ[{29}, Mod[#, 61]] &] (* _Vincenzo Librandi_, Sep 05 2012 *)
%o A142827 (Magma) [p: p in PrimesUpTo(18000) | p mod 61 eq 29 ] ; // _Vincenzo Librandi_, Sep 05 2012
%o A142827 (PARI) is(n)=isprime(n) && n%61==29 \\ _Charles R Greathouse IV_, Jul 03 2016
%Y A142827 Cf. A000040, A144562.
%K A142827 nonn,easy
%O A142827 1,1
%A A142827 _N. J. A. Sloane_, Jul 11 2008