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.

A138625 Primes congruent to 12 mod 17.

This page as a plain text file.
%I A138625 #13 Sep 08 2022 08:45:33
%S A138625 29,97,131,199,233,607,641,709,743,811,947,1049,1117,1151,1321,1423,
%T A138625 1559,1627,1831,1933,2069,2137,2239,2273,2341,2477,2579,2647,2749,
%U A138625 2851,2953,3089,3191,3259,3361,3463,3701,3769,3803,4007,4177,4211,4483,4517,4721
%N A138625 Primes congruent to 12 mod 17.
%H A138625 Vincenzo Librandi, <a href="/A138625/b138625.txt">Table of n, a(n) for n = 1..1000</a>
%F A138625 a(n) ~ 16n log n. - _Charles R Greathouse IV_, Jul 02 2016
%e A138625 17*2-5=29, 17*6-5=97, 17*8-5=131, 17*12-5=199,...
%t A138625 a={};Do[x=17*n-5;If[PrimeQ[x],AppendTo[a,x]],{n,10^2}];a
%t A138625 Select[Prime[Range[700]],MemberQ[{12},Mod[#,17]]&] (* _Vincenzo Librandi_, Aug 15 2012 *)
%o A138625 (Magma) [p: p in PrimesUpTo(6000) | p mod 17 eq 12 ]; // _Vincenzo Librandi_, Aug 15 2012
%o A138625 (PARI) is(n)=isprime(n) && n%17==12 \\ _Charles R Greathouse IV_, Jul 02 2016
%Y A138625 Cf. A000040.
%K A138625 nonn,easy
%O A138625 1,1
%A A138625 _Vladimir Joseph Stephan Orlovsky_, May 14 2008
%E A138625 More terms from _N. J. A. Sloane_, Jul 11 2008
%E A138625 Edited by _N. J. A. Sloane_ at the suggestion of R. J. Mathar, Jul 20 2008