Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046069
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A046069
%S A046069 2,0,2,1,1,2,3,1,2,1,1,4,3,1,4,1,2,2,1,3,2,7,1,4,1,1,2,1,1,12,3,2,4,5,
%T A046069 1,2,7,1,2,1,3,2,5,1,4,1,3,2,1,1,10,3,2,10,9,2,8,1,1,12,1,2,2,25,1,2,
%U A046069 3,1,2,1,1,2,5,1,4,5,3,2,1,1,2,3,2,4,1,2,2,1,1,8,3,4,2,1,3,226,3,1,2
%N A046069 Smallest m >= 0 such that (2n-1)2^m-1 is prime, or -1 if no such value 
               exists.
%C A046069 There exist odd integers 2k-1 such that (2k-1)2^n-1 is always composite.
%D A046069 Ribenboim, P., The New Book of Prime Number Records. New York: Springer-Verlag, 
               pp. 357-359, 1996.
%H A046069 T. D. Noe, <a href="b046069.txt">Table of n, a(n) for n=1..1000</a>
%H A046069 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               RieselNumber.html">Link to a section of The World of Mathematics.</
               a>
%Y A046069 Cf. A046067, A046070.
%Y A046069 Bisection of A040081.
%Y A046069 Sequence in context: A112022 A000586 A029399 this_sequence A055651 A079627 
               A061398
%Y A046069 Adjacent sequences: A046066 A046067 A046068 this_sequence A046070 A046071 
               A046072
%K A046069 nonn
%O A046069 1,1
%A A046069 Eric Weisstein (eric(AT)weisstein.com)

    
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 30 13:09 EST 2009. Contains 167659 sequences.


AT&T Labs Research