Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118539
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118539 Adjacent generalized Fermat primes. +0
1
3, 3, 3, 75, 113, 2163, 63739, 13221, 54809, 3656571, 6992033, 125441 (list; graph; listen)
OFFSET

1,1

LINKS

David Broadhurst, Posting to PrimeForm list.

Yves Gallot's compilation of generalized Fermat primes.

FORMULA

a(n) is the smallest number such that (a(n)+1)^(2^n)+1 and (a(n)-1)^(2^n)+1 are both prime.

EXAMPLE

a(11)=6992033 because 6992034^2048+1 is prime, 6992032^2048+1 is prime and no smaller pair of bases differing by 2 gives a pair of primes with the exponent 2^11=2048.

CROSSREFS

Sequence in context: A025549 A135584 A091323 this_sequence A015665 A131462 A117032

Adjacent sequences: A118536 A118537 A118538 this_sequence A118540 A118541 A118542

KEYWORD

hard,nonn

AUTHOR

David Broadhurst (D.Broadhurst(AT)open.ac.uk), May 06 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research