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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036013 a(n) = smallest number >1 such that a(1)a(2)...a(n) - 1 is prime (or 1). 4
2, 2, 2, 3, 2, 4, 2, 3, 6, 4, 5, 5, 5, 10, 4, 3, 5, 8, 22, 13, 14, 2, 5, 5, 2, 20, 9, 9, 24, 5, 26, 15, 14, 25, 25, 4, 9, 30, 9, 21, 12, 11, 10, 2, 40, 19, 8, 13, 11, 50, 3, 25, 25, 8, 5, 25, 46, 19, 47, 54, 9, 13, 14, 43, 4, 24, 28, 16, 33, 25, 152, 2, 11, 22, 6, 78, 87, 7, 10, 21 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

T. D. Noe, Table of n, a(n) for n=1..300

CROSSREFS

Cf. A036012.

Sequence in context: A156862 A076709 A110021 * A126336 A134446 A125749

Adjacent sequences:  A036010 A036011 A036012 * A036014 A036015 A036016

KEYWORD

nonn,nice,easy

AUTHOR

Russell Easterly (logiclab(AT)attbi.com)

EXTENSIONS

More terms from Erich Friedman (erich.friedman(AT)stetson.edu). More terms from Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu), Jan 26 2000.

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 08:49 EST 2012. Contains 205740 sequences.