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

 

Logo
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

%I #11 Apr 16 2022 15:00:57

%S 2,3,5,11,19,37,67,127,233,431,797,1471,2699,4967,9137,16811,30931,

%T 56891,104639,192461,354001,651103,1197571,2202677,4051361,7451617,

%U 13705667,25208653,46365959,85280323,156854959,288501287,530636569

%N 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).

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

%p 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

%K nonn

%O 0,1

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

%E More terms from _Emeric Deutsch_, Feb 27 2009

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 April 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)