login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219313 Smallest number k such that LegendreP[2*n, k] is prime. 1

%I #9 Mar 18 2017 23:39:34

%S 3,7,7,3,41,5,89,23,21,35,55,5,181,511,241,83,709,401,3653,901,137,

%T 497,1411,121,281,209,201,191,1667,89,39,181,233,2783,85,911,1717,919,

%U 97,1163,1319,971,361,2371,1573,121,817,733,1657,1895,509,431,2399,1483

%N Smallest number k such that LegendreP[2*n, k] is prime.

%C LegendreP [2*n, x] is the 2*n th Legendre polynomial of the first kind evaluated at x.

%C The corresponding primes are in A219315.

%D M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 798.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LegendrePolynomial.html">Legendre Polynomial</a>

%e a(1) = 3 because LegendreP[2*1, x] = (3x^2 - 1)/2 = P(x) and P(3) = 13 is prime.

%t Table[k = 0; While[!PrimeQ[LegendreP [2*n,k]], k++]; k, {n, 70}]

%o (PARI) a(n)=my(P=pollegendre(2*n),k,t); while(denominator(t=subst(P,'x,k++))>1 || !ispseudoprime(t), ); k \\ _Charles R Greathouse IV_, Mar 18 2017

%Y Cf. A219315.

%K nonn

%O 1,1

%A _Michel Lagneau_, Nov 17 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 11:08 EDT 2024. Contains 371711 sequences. (Running on oeis4.)