OFFSET
1,1
COMMENTS
Banks & Freiberg show that this sequence is infinite.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (calculated using data from Claude Goutier; terms 1..733 from Giovanni Resta)
William D. Banks and Tristan Freiberg, Carmichael numbers and the sieve, Journal of Number Theory, Vol. 165 (2016), pp. 15-29; arXiv preprint, arXiv:1506.03497 [math.NT], 2015.
PROG
(PARI) has(n)=for(x=sqrtint(n\2), sqrtint(n-1), if(issquare(n-x^2-1), return(1))); 0
Korselt(n, f=factor(n))=for(i=1, #f~, if(f[i, 2]>1||(n-1)%(f[i, 1]-1), return(0))); 1
is(n)=my(f); if(n%2==0||isprime(n)||!Korselt(n, f=factor(n))||n<9, return(0)); for(i=1, #f~, if(!has(f[i, 1]), return(0))); 1 \\ Charles R Greathouse IV, Jun 12 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Jun 12 2015
STATUS
approved