Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049479 Smallest prime dividing 2^n - 1. +0
8
3, 7, 3, 31, 3, 127, 3, 7, 3, 23, 3, 8191, 3, 7, 3, 131071, 3, 524287, 3, 7, 3, 47, 3, 31, 3, 7, 3, 233, 3, 2147483647, 3, 7, 3, 31, 3, 223, 3, 7, 3, 13367, 3, 431, 3, 7, 3, 2351, 3, 127, 3, 7, 3, 6361, 3, 23, 3, 7, 3, 179951, 3, 2305843009213693951, 3, 7, 3, 31 (list; graph; listen)
OFFSET

2,1

LINKS

T. D. Noe, Table of n, a(n) for n=2..500 (derived from Brillhart et al.)

Eric Weisstein's World of Mathematics, Mersenne Number

EXAMPLE

a(6)=3 since 2^6 - 1 = 63 = 3^2*7

MATHEMATICA

a = {}; Do[w = 2^n - 1; c = FactorInteger[w]; b = c[[1]][[1]]; AppendTo[a, b], {n, 2, 65}]; a - Artur Jasinski (grafix(AT)csl.pl), Dec 11 2007

CROSSREFS

Cf. A005420.

Sequence in context: A088837 A019158 A086153 this_sequence A125314 A050393 A110778

Adjacent sequences: A049476 A049477 A049478 this_sequence A049480 A049481 A049482

KEYWORD

nonn

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

EXTENSIONS

More terms from Michael Lugo (mlugo(AT)thelabelguy.com), Dec 22 1999

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research