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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087522 a(0) = 2; for n>=1, a(n) = smallest prime p such that p+1 is divisible by an n-th power > 1. 13
2, 2, 3, 7, 31, 31, 127, 127, 1279, 3583, 5119, 6143, 8191, 8191, 81919, 131071, 131071, 131071, 524287, 524287, 14680063, 14680063, 109051903, 109051903, 654311423, 738197503, 738197503, 2147483647, 2147483647, 2147483647, 2147483647 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Trivially the n-th power under consideration is 2^n for n > 1.

EXAMPLE

a(1) = 2 because 3|3.

a(2) = 3 because 2^2|4.

a(3) = 7 because 2^3|8.

CROSSREFS

A127582 is a very similar sequence.

Sequence in context: A038507 A077001 A180996 * A092970 A052449 A053413

Adjacent sequences:  A087519 A087520 A087521 * A087523 A087524 A087525

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 11 2003

EXTENSIONS

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 14 2003

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 03 2008

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 15 11:25 EST 2012. Contains 205777 sequences.