Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135978
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135978 Prime numbers n such that Mersenne composite 2^n-1 has exactly 2 prime factors. +0
5
11, 23, 37, 41, 59, 67, 83, 97, 101, 103, 109, 131, 137, 139, 149, 167 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

k = {}; Do[If[ ! PrimeQ[2^Prime[n] - 1], c = FactorInteger[2^Prime[n] - 1]; d = Length[c]; If[d == 2, AppendTo[k, Prime[n]]]], {n, 1, 40}]; k

CROSSREFS

Cf. A000225, A065341, A054723, A134852, A135975, A135976, A135977, A135978.

Sequence in context: A139793 A101859 A079664 this_sequence A139493 A077345 A130282

Adjacent sequences: A135975 A135976 A135977 this_sequence A135979 A135980 A135981

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Dec 09 2007

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 July 23 10:48 EDT 2008. Contains 142285 sequences.


AT&T Labs Research