Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063897
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063897 Smallest n such that n - F_j are all primes, where F_j is the j-th Fermat number. +0
2
5, 8, 22, 274, 65704, 4295145556, 18446744073810262144 (list; graph; listen)
OFFSET

0,1

COMMENT

Is this sequence finite?

EXAMPLE

For j=3 a(3)=274 because 274-257, 274-17, 274-5, 274-3 are all primes.

CROSSREFS

Sequence in context: A120041 A120042 A120043 this_sequence A092733 A116884 A105963

Adjacent sequences: A063894 A063895 A063896 this_sequence A063898 A063899 A063900

KEYWORD

more,nonn

AUTHOR

Felice Russo (felice.russo(AT)katamail.com), Aug 29 2001

EXTENSIONS

18446744073810262144 from Thomas Baruchel (baruchel(AT)users.sourceforge.net), Oct 21 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research