Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145099
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145099 a(n) = 1 if largest divisor of Mersenne composite A145097(n) is prime and a(n) = 0 in opposite case. +0
2
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; listen)
OFFSET

1,1

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

A065341, A135975, A135980, A145097, A145098

Sequence in context: A128432 A039966 A089451 this_sequence A070886 A041004 A141736

Adjacent sequences: A145096 A145097 A145098 this_sequence A145100 A145101 A145102

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Oct 01 2008

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research