The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A117293 Mersenne primes written in binary. 6
 11, 111, 11111, 1111111, 1111111111111, 11111111111111111, 1111111111111111111, 1111111111111111111111111111111, 1111111111111111111111111111111111111111111111111111111111111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The number of bits in a(n) is equal to A000043(n). - Omar E. Pol, Feb 22 2008 LINKS Wikipedia, Mersenne prime EXAMPLE Third mersenne prime is 31, i.e. 11111 in binary. PROG (PARI) apply(p->fromdigits(binary(p)), select(isprime, vector(20, n, 2^prime(n)-1))) \\ Charles R Greathouse IV, Sep 14 2016 CROSSREFS Cf. A000043, A000668. Sequence in context: A083441 A261269 A031974 * A015468 A037842 A131293 Adjacent sequences:  A117290 A117291 A117292 * A117294 A117295 A117296 KEYWORD base,nonn AUTHOR Jacob Vecht, Apr 23 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 23 13:34 EST 2020. Contains 331171 sequences. (Running on oeis4.)