The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A122263 a(n) = 2*a(n-1)-a(n-2)+2*(Prime[n+1]-Prime[n]). 0

%I #6 Mar 12 2014 16:36:56

%S 2,3,8,21,38,63,92,129,178,231,296,369,446,531,628,737,850,975,1108,

%T 1245,1394,1551,1720,1905,2098,2295,2500,2709,2926,3171

%N a(n) = 2*a(n-1)-a(n-2)+2*(Prime[n+1]-Prime[n]).

%t f[1] = 2; f[2] = 3; f[n_] := f[n] = 2*f[n - 1] - f[n - 2] + 2*(Prime[n + 1] - Prime[n]); Table[f[n], {n, 1, 30}]

%K nonn

%O 1,1

%A _Roger L. Bagula_, Oct 18 2006

%E Edited by _N. J. A. Sloane_, Oct 23 2006

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 May 20 21:47 EDT 2024. Contains 372720 sequences. (Running on oeis4.)