|
| |
|
|
A063825
|
|
(n-3, n-5, n-17, n-257, n-65537) are all primes.
|
|
1
| |
|
|
65704, 66364, 72106, 74764, 80686, 80914, 82474, 85456, 85834, 89074, 89674, 92644, 94564, 95806, 97006, 97384, 97864, 98644, 100804, 101284, 102004, 105256, 108964, 113044, 113176, 119704, 121024, 121954, 123736, 125644, 127294, 129226
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| 3, 5, 17, 257 and 65537 are the only known Fermat primes. The counting function p(N) seems to follow the law: p(N)~c*N^(4/3*gamma) where c is a positive constant and gamma the Euler constant. If so the sequence is infinite.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
MATHEMATICA
| Select[Range[65538, 130000], PrimeQ[ #-3]&&PrimeQ[ #-5]&&PrimeQ[ #-17]&&PrimeQ[ #-257]&&PrimeQ[ #-65537]&] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Mar 31 2006
|
|
|
PROG
| (PARI) { n=0; for (m=1, 10^9, if(isprime(m - 3) && isprime(m - 5) && isprime(m - 17) && isprime(m - 257) && isprime(m - 65537), write("b063825.txt", n++, " ", m); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 01 2009]
|
|
|
CROSSREFS
| A063799, A019434.
Sequence in context: A096555 A168667 A170781 * A170790 A043678 A032781
Adjacent sequences: A063822 A063823 A063824 * A063826 A063827 A063828
|
|
|
KEYWORD
| easy,nice,nonn
|
|
|
AUTHOR
| Felice Russo (frusso(AT)micron.com), Aug 21 2001
|
| |
|
|
