login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155954 a(0)=2, a(1)=3, a(2)=5, a(n) = smallest prime greater than or equal to a(n-1) + a(n-2) + a(n-3). 0
2, 3, 5, 11, 19, 37, 67, 127, 233, 431, 797, 1471, 2699, 4967, 9137, 16811, 30931, 56891, 104639, 192461, 354001, 651103, 1197571, 2202677, 4051361, 7451617, 13705667, 25208653, 46365959, 85280323, 156854959, 288501287, 530636569 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..32.

EXAMPLE

a(2) + a(3) + a(4) = 35, so a(5) = (smallest prime larger than 35) = 37.

MAPLE

a[0] := 2: a[1] := 3: a[2] := 5: for n from 3 to 35 do a[n] := nextprime(a[n-1]+a[n-2]+a[n-3]-1) end do: seq(a[n], n = 0 .. 35); # Emeric Deutsch, Feb 27 2009

CROSSREFS

Sequence in context: A084697 A037082 A084573 * A337347 A087581 A049888

Adjacent sequences: A155951 A155952 A155953 * A155955 A155956 A155957

KEYWORD

nonn

AUTHOR

Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 31 2009

EXTENSIONS

More terms from Emeric Deutsch, Feb 27 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 04:45 EST 2022. Contains 358422 sequences. (Running on oeis4.)