login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065341 Mersenne composites: 2^prime(n) - 1 is not a prime. 12
2047, 8388607, 536870911, 137438953471, 2199023255551, 8796093022207, 140737488355327, 9007199254740991, 576460752303423487, 147573952589676412927, 2361183241434822606847, 9444732965739290427391 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Number of prime factors in a(n) see A135975. Indices of primes n in composite 2^Prime[n]-1 see A135980. Smallest prime divisors of Mersenne composites see A136030. Biggest prime divisors of Mersenne composites see A145098 Biggest divisors see A145097. [From Artur Jasinski (grafix(AT)csl.pl), Oct 01 2008]

FORMULA

a(n)=-1+2^A054723(n)

EXAMPLE

2047=23.89

MAPLE

A065341 := proc(n) local i;

i := 2^(ithprime(n))-1:

if (not isprime(i)) then

   RETURN (i)

fi: end: seq(A065341(n), n=1..21); # - Jani Melik, Feb 09 2011

MATHEMATICA

a = {}; Do[m = 2^Prime[n] - 1; If[PrimeQ[m], NULL, AppendTo[a, m]], {n, 1, 20}]; a [From Artur Jasinski (grafix(AT)csl.pl), Oct 01 2008]

CROSSREFS

Cf. A054723, A000043, A000668, A001348

A135975, A135980, A145097, A145098 [From Artur Jasinski (grafix(AT)csl.pl), Oct 01 2008]

Sequence in context: A069412 A069438 A131952 * A135976 A035892 A069272

Adjacent sequences:  A065338 A065339 A065340 * A065342 A065343 A065344

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 30 2001

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 .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.