|
Search: id:A063898
|
|
|
| A063898 |
|
Smallest n such that n + F_j are all primes for 0 < j <= n, where F_j is the j-th Fermat number. |
|
+0
1
|
|
| 2, 2, 2, 14, 14, 14, 66746, 475424, 12124166, 14899339904
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Is this sequence finite?
|
|
EXAMPLE
|
For j=4 a(4)=14 because 65537+14, 257+14, 17+14, 5+14, 3+14 are all primes.
|
|
CROSSREFS
|
A000215 (Fermat numbers)
Sequence in context: A077945 A077991 A049148 this_sequence A074052 A129409 A025521
Adjacent sequences: A063895 A063896 A063897 this_sequence A063899 A063900 A063901
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Aug 29 2001
|
|
EXTENSIONS
|
a(10) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Oct 12 2008
|
|
|
Search completed in 0.002 seconds
|
