OFFSET
1,1
COMMENTS
Also odd primes congruent to {2, 3} mod 5, or primes with last digit 3 or 7. - Alexander Adamchuk, Nov 02 2006
5 is not a square mod p. - Michael Somos, Aug 15 2012
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
FORMULA
a(n) = A003631(n-1). - Alexander Adamchuk, Nov 02 2006
EXAMPLE
5^3 + 4^3 = 7*27
MATHEMATICA
Select[Prime[Range[120]], Divisible[5^((#-1)/2)+4^((#-1)/2), #]&] (* Harvey P. Dale, Feb 25 2013 *)
PROG
(PARI) \s = +-1, d=diff ptopm1d2(n, x, d, s) = { forprime(p=3, n, p2=(p-1)/2; y=x^p2 + s*(x-d)^p2; if(y%p==0, print1(p", "))) }
(PARI) {a(n) = local( cnt, m ); if( n<1, return( 0 )); while( cnt < n, if( isprime( m++) && kronecker( 20, m )== -1, cnt++ )); m} /* Michael Somos, Aug 15 2012 */
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Cino Hilliard, Sep 06 2004
EXTENSIONS
Definition clarified by Harvey P. Dale, Feb 25 2013
STATUS
approved