This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006514 2^p - 1 has at most 2 prime factors. (Formerly M0653) 0

%I M0653

%S 2,3,5,7,11,13,17,19,23,31,37,41,59,61,67,83,89,97,101,103,107,109,

%T 127,131,137,139,149,167,197,199,227,241,269,271,281,293,347,373,379,

%U 421,457,487,521

%N 2^p - 1 has at most 2 prime factors.

%C p must be a prime. [From Harvey P. Dale, Nov 11 2011]

%D J. Brillhart et al., Factorizations of b^n +- 1. Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 2nd edition, 1985; and later supplements.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H J. Brillhart et al., <a href="http://www.ams.org/online_bks/conm22/">Factorizations of b^n +- 1</a>, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.

%H S. S. Wagstaff, Jr., <a href="http://www.cerias.purdue.edu/homes/ssw/cun/index.html">The Cunningham Project</a>

%t Select[Prime[Range[100]],PrimeOmega[2^#-1]<3&] (* From Harvey P. Dale, Nov 11 2011 *)

%K nonn

%O 1,1

%A _N. J. A. Sloane_.

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 .