Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101331
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A101331
%S A101331 3,5,257,340282366920938463463374607431768211457
%N A101331 Fermat(Mersenne(x)) = 2^(2^(2^x-1))+1
%C A101331 Fermat-Mersenne numbers.
%e A101331 F(M(0))= 3
%e A101331 F(M(1))= 5
%e A101331 F(M(2))= 257
%e A101331 F(M(3))= 340282366920938463463374607431768211457
%o A101331 (PARI) for(x=0,4,print( ( 2^(2^(2^x-1))+1 )))
%Y A101331 Sequence in context: A012817 A087367 A058846 this_sequence A087368 A087670 
               A138584
%Y A101331 Adjacent sequences: A101328 A101329 A101330 this_sequence A101332 A101333 
               A101334
%K A101331 nonn
%O A101331 0,1
%A A101331 Jorge Coveiro (jorgecoveiro(AT)yahoo.com), Dec 24 2004

    
page 1

Search completed in 0.001 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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research