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.

A138623 Primes congruent to 5 mod 17.

This page as a plain text file.
%I A138623 #15 Sep 08 2022 08:45:33
%S A138623 5,73,107,277,311,379,617,719,787,821,991,1093,1229,1297,1399,1433,
%T A138623 1637,2011,2113,2351,2521,2657,2861,2963,3167,3371,3541,3643,3677,
%U A138623 3779,3847,3881,4051,4153,4289,4357,4391,4493,4561,4663,4799,4969,5003,5309,5479
%N A138623 Primes congruent to 5 mod 17.
%H A138623 Vincenzo Librandi, <a href="/A138623/b138623.txt">Table of n, a(n) for n = 1..1000</a>
%F A138623 a(n) ~ 16n log n. - _Charles R Greathouse IV_, Jul 02 2016
%e A138623 17*0+5=5, 17*4+5=73, 17*6+5=107, 17*16+5=277,...
%t A138623 a={};Do[x=17*n+5;If[PrimeQ[x],AppendTo[a,x]],{n,10^2}];a
%t A138623 Select[Prime[Range[800]], MemberQ[{5}, Mod[#, 17]] &] (* _Vincenzo Librandi_, Aug 15 2012 *)
%t A138623 Select[Range[5,5500,17],PrimeQ] (* _Harvey P. Dale_, Aug 10 2021 *)
%o A138623 (Magma) [p: p in PrimesUpTo(6000) | p mod 17 eq 5 ]; // _Vincenzo Librandi_, Aug 15 2012
%o A138623 (PARI) is(n)=isprime(n) && n%17==5 \\ _Charles R Greathouse IV_, Jul 02 2016
%Y A138623 Cf. A000040.
%K A138623 nonn,easy
%O A138623 1,1
%A A138623 _Vladimir Joseph Stephan Orlovsky_, May 14 2008
%E A138623 More terms from _N. J. A. Sloane_, Jul 11 2008
%E A138623 Edited by _N. J. A. Sloane_ at the suggestion of R. J. Mathar, Jul 20 2008