This site is supported by donations to The OEIS 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!)
 A145099 a(n) = 1 if largest divisor of Mersenne composite A145097(n) is prime and a(n) = 0 in opposite case. 1
 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA a = {}; Do[m = 2^Prime[n] - 1; k = Divisors[m][[ -2]]; If[PrimeQ[m], null, If[PrimeQ[k], AppendTo[a, 1], AppendTo[a, 0]]], {n, 1, 50}]; a (* Artur Jasinski *) CROSSREFS Cf. A065341, A135975, A135980, A145097, A136031. Sequence in context: A195198 A039966 A089451 * A205083 A070886 A262808 Adjacent sequences:  A145096 A145097 A145098 * A145100 A145101 A145102 KEYWORD nonn AUTHOR Artur Jasinski, Oct 01 2008 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 16 21:37 EST 2019. Contains 319206 sequences. (Running on oeis4.)