Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129613
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129613 a(n) is the smallest natural number m such that 2^(2^k) + m is prime for k=0,1,...,n. +0
4
1, 1, 1, 1, 1, 15, 66747, 475425, 12124167, 14899339905 (list; graph; listen)
OFFSET

0,6

COMMENT

The first five terms of this sequence correspond to known Fermat primes. Next term is greater than 5*10^8.

CROSSREFS

Cf. A090872, A090874, A090875, A129614, A129615.

Sequence in context: A013756 A078185 A096224 this_sequence A013802 A084878 A013874

Adjacent sequences: A129610 A129611 A129612 this_sequence A129614 A129615 A129616

KEYWORD

nonn

AUTHOR

Farideh Firoozbakht (mymontain(AT)yahoo.com), May 13 2007, May 16 2007

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 December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research