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.

A132233 Primes congruent to 13 (mod 30).

This page as a plain text file.
%I A132233 #20 Sep 08 2022 08:45:31
%S A132233 13,43,73,103,163,193,223,283,313,373,433,463,523,613,643,673,733,823,
%T A132233 853,883,1033,1063,1093,1123,1153,1213,1303,1423,1453,1483,1543,1663,
%U A132233 1693,1723,1753,1783,1873,1933,1993,2053,2083,2113,2143,2203,2293,2383
%N A132233 Primes congruent to 13 (mod 30).
%C A132233 Primes ending in 3 with (SOD-1)/3 integer where SOD is sum of digits. - _Ki Punches_
%C A132233 Subsequence of primes of A082369. - _Michel Marcus_, Jan 23 2016
%H A132233 Vincenzo Librandi, <a href="/A132233/b132233.txt">Table of n, a(n) for n = 1..1000</a>
%H A132233 C. K. Caldwell, <a href="http://primes.utm.edu">The Prime Pages</a>.
%H A132233 Omar E. Pol, <a href="http://www.polprimos.com">Determinacion geometrica de los numeros primos y perfectos</a>.
%F A132233 a(n) = A158746(n)*30 + 13. - _Ray Chandler_, Apr 07 2009
%F A132233 Intersection of A030431 and A002476. - _Ray Chandler_, Apr 07 2009
%p A132233 select(isprime, [seq(30*i+13,i=0..1000)]); # _Robert Israel_, Jan 24 2016
%t A132233 Select[Prime[Range[1000]],MemberQ[{13},Mod[#,30]]&] (* _Vincenzo Librandi_, Aug 14 2012 *)
%o A132233 (Magma) [p: p in PrimesUpTo(3000) | p mod 30 eq 13 ]; // _Vincenzo Librandi_, Aug 14 2012
%o A132233 (PARI) lista(nn) = forprime(p=2, nn, if(p % 30 == 13, print1(p, ", "))); \\ _Altug Alkan_, Jan 23 2016
%Y A132233 Cf. A000040, A039949, A082369, A132230-A132236.
%K A132233 nonn,easy
%O A132233 1,1
%A A132233 _Omar E. Pol_, Aug 15 2007
%E A132233 Extended by _Ray Chandler_, Apr 07 2009