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 A142398 #18 Feb 24 2023 10:17:06
%S A142398 97,193,241,337,433,577,673,769,1009,1153,1201,1249,1297,1489,1777,
%T A142398 1873,2017,2113,2161,2593,2689,2833,3121,3169,3217,3313,3361,3457,
%U A142398 3697,3793,3889,4129,4177,4273,4513,4561,4657,4801,4993,5233,5281,5521,5569,5857
%N A142398 Primes congruent to 1 mod 48.
%H A142398 Vincenzo Librandi, <a href="/A142398/b142398.txt">Table of n, a(n) for n = 1..1000</a>
%F A142398 a(n) ~ 16n log n. - _Charles R Greathouse IV_, Jul 03 2016
%t A142398 lst={};Do[If[Mod[n,48]==1,If[PrimeQ[n],AppendTo[lst,n]]],{n,8!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Jun 20 2009 *)
%t A142398 Select[Prime[Range[1000]], MemberQ[{1}, Mod[#, 48]] &] (* _Vincenzo Librandi_, Aug 27 2012 *)
%t A142398 Select[Range[1,6000,48],PrimeQ] (* _Harvey P. Dale_, Feb 24 2023 *)
%o A142398 (Magma) [p: p in PrimesUpTo(6000) | p mod 48 eq 1]; // _Vincenzo Librandi_, Aug 27 2012
%o A142398 (PARI) is(n)=isprime(n) && n%48==1 \\ _Charles R Greathouse IV_, Jul 03 2016
%Y A142398 Cf. A000040.
%K A142398 nonn,easy
%O A142398 1,1
%A A142398 _N. J. A. Sloane_, Jul 11 2008