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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090874 a(n) is the smallest number m such that m^2^k + (m+1)^2^k is prime for k=0,1,...,n. 2
1, 1, 1, 1, 1, 1806390369 (list; graph; refs; listen; history; internal format)
OFFSET

0,6

COMMENTS

The first five terms of this sequence correspond to Fermat primes.

EXAMPLE

a(5)=1806390369 because 1806390369 is the smallest number m such that

m^2^k+(m+1)^2^k is prime for k=0,1,2,3,4 and 5.

CROSSREFS

Cf. A090872, A090873, A019434, A000215.

Sequence in context: A198177 A129616 A105006 * A071371 A052094 A015429

Adjacent sequences:  A090871 A090872 A090873 * A090875 A090876 A090877

KEYWORD

nonn

AUTHOR

Farideh Firoozbakht (f.firoozbakht(AT)sci.ui.ac.ir), Feb 06 2004

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 12 02:53 EST 2012. Contains 205360 sequences.