login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
2, 2, 2, 14, 14, 14, 66746, 475424, 12124166, 14899339904 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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: A077991 A049148 A183584 * A074052 A129409 A025521

Adjacent sequences:  A063895 A063896 A063897 * A063899 A063900 A063901

KEYWORD

more,nonn

AUTHOR

Felice Russo (frusso(AT)micron.com), Aug 29 2001

EXTENSIONS

a(10) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Oct 12 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 18:41 EST 2012. Contains 206074 sequences.