Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090874
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A090874
%S A090874 1,1,1,1,1,1806390369
%N A090874 a(n) is the smallest number m such that m^2^k + (m+1)^2^k is prime for 
               k=0,1,...,n.
%C A090874 The first five terms of this sequence correspond to Fermat primes.
%e A090874 a(5)=1806390369 because 1806390369 is the smallest number m such that
%e A090874 m^2^k+(m+1)^2^k is prime for k=0,1,2,3,4 and 5.
%Y A090874 Cf. A090872, A090873, A019434, A000215.
%Y A090874 Sequence in context: A147769 A129616 A105006 this_sequence A071371 A052094 
               A015429
%Y A090874 Adjacent sequences: A090871 A090872 A090873 this_sequence A090875 A090876 
               A090877
%K A090874 nonn
%O A090874 0,6
%A A090874 Farideh Firoozbakht (f.firoozbakht(AT)sci.ui.ac.ir), Feb 06 2004

    
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