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.

A141941 Primes congruent to 18 mod 25.

This page as a plain text file.
%I A141941 #17 Apr 29 2025 04:52:22
%S A141941 43,193,293,443,593,643,743,1093,1193,1493,1543,1693,1993,2143,2243,
%T A141941 2293,2393,2543,2593,2693,2843,3343,3593,3643,3793,3943,4093,4243,
%U A141941 4493,4643,4793,4943,4993,5393,5443,5693,5743,5843,6043,6143,6343,6793,7043,7193
%N A141941 Primes congruent to 18 mod 25.
%C A141941 Primes congruent to 43 mod 50. - _Chai Wah Wu_, Apr 28 2025
%H A141941 Vincenzo Librandi, <a href="/A141941/b141941.txt">Table of n, a(n) for n = 1..1000</a>
%F A141941 a(n) ~ 20n log n. - _Charles R Greathouse IV_, Jul 02 2016
%t A141941 Select[Range[18, 20000, 25], PrimeQ] (* _Vladimir Joseph Stephan Orlovsky_, Jun 15 2011 *)
%o A141941 (Magma) [p: p in PrimesUpTo(8000) | p mod 25 eq 18 ]; // _Vincenzo Librandi_, Aug 16 2012
%o A141941 (PARI) is(n)=isprime(n) && n%25==18 \\ _Charles R Greathouse IV_, Jul 02 2016
%o A141941 (Python)
%o A141941 from itertools import count, islice
%o A141941 from sympy import isprime
%o A141941 def A141941_gen(): # generator of terms
%o A141941     return filter(isprime,count(43,50))
%o A141941 A141941_list = list(islice(A141941_gen(),48)) # _Chai Wah Wu_, Apr 28 2025
%Y A141941 Cf. A000040.
%K A141941 nonn,easy
%O A141941 1,1
%A A141941 _N. J. A. Sloane_, Jul 11 2008