cp's OEIS Frontend

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.

A142508 Primes congruent to 1 mod 52.

This page as a plain text file.
%I A142508 #19 Apr 29 2025 13:37:37
%S A142508 53,157,313,521,677,937,1093,1249,1301,1613,1873,2029,2081,2237,2341,
%T A142508 2393,2549,2861,3121,3329,3433,3797,4057,4421,4733,4889,4993,5669,
%U A142508 5981,6397,6449,6553,6709,6761,6917,7177,7229,7333,7489,7541,7853,8009,8269,8581
%N A142508 Primes congruent to 1 mod 52.
%H A142508 Vincenzo Librandi, <a href="/A142508/b142508.txt">Table of n, a(n) for n = 1..1000</a>
%t A142508 Select[Prime[Range[1300]], MemberQ[{1}, Mod[#, 52]] &] (* _Vincenzo Librandi_, Aug 29 2012 *)
%t A142508 Select[Range[1,9000,52],PrimeQ] (* _Harvey P. Dale_, Jun 25 2013 *)
%o A142508 (Magma) [p: p in PrimesUpTo(9000) | p mod 52 eq 1]; // _Vincenzo Librandi_, Aug 29 2012
%o A142508 (PARI) is(n)=isprime(n) && n%52==1 \\ _Charles R Greathouse IV_, Jul 01 2016
%o A142508 (Python)
%o A142508 from itertools import count, islice
%o A142508 from sympy import isprime
%o A142508 def A142508_gen(): # generator of terms
%o A142508     return filter(isprime,count(1,52))
%o A142508 A142508_list = list(islice(A142508_gen(),30)) # _Chai Wah Wu_, Apr 29 2025
%Y A142508 Cf. A000040.
%K A142508 nonn,easy
%O A142508 1,1
%A A142508 _N. J. A. Sloane_, Jul 11 2008