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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152445 a(0) = a(1) = 1. For n >= 2, a(n) = the smallest prime >= a(n-1)*a(n-2). 2
1, 1, 2, 2, 5, 11, 59, 653, 38543, 25168589, 970072925867, 24415366771173991757, 23684686279828682858246730078719, 578270302382209771209755703072864217352250067119367 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

MAPLE

A152445 := proc(n) option remember ; if n <= 1 then 1; else nextprime(procname(n-1)*procname(n-2)-1) ; fi; end: for n from 0 to 15 do printf("%d, ", A152445(n)) ; od; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 05 2008]

MATHEMATICA

a = {1, 1, 2, 2}; Do[AppendTo[a, Prime[PrimePi[a[[ -1]]*a[[ -2]]] + 1]], {7}]; a [From Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 06 2008]

CROSSREFS

A152446

Sequence in context: A049680 A153983 A058021 * A077182 A143195 A192799

Adjacent sequences:  A152442 A152443 A152444 * A152446 A152447 A152448

KEYWORD

nonn

AUTHOR

Leroy Quet Dec 04 2008

EXTENSIONS

Extended beyond a(7) by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Stefan Steinerberger (stefan.steinerberger(AT)gmail.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 05 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 14 04:29 EST 2012. Contains 205570 sequences.