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!)
A093809 a[n] =a[n-1] + 2*n*Prime[n]-n^2 0

%I #6 May 01 2017 10:47:15

%S 0,8,29,69,154,274,463,703,1036,1516,2077,2821,3718,4726,5911,7351,

%T 9068,10940,13125,15565,18190,21182,24471,28167,32392,36968,41801,

%U 47009,52490,58370,65283,72643,80596,88892,98097,107673,117922,128866,140371

%N a[n] =a[n-1] + 2*n*Prime[n]-n^2

%t hg[n_Integer?Positive] :=hg[n] =hg[n-1] + 2*n*Prime[n]-n^2 hg[1] =0 digits=50 a=Table[hg[n], {n, 1, digits}]

%t nxt[{n_,a_}]:={n+1,a+2(n+1)Prime[n+1]-(n+1)^2}; NestList[nxt,{1,0},40][[All,2]] (* _Harvey P. Dale_, May 01 2017 *)

%K nonn

%O 1,2

%A _Roger L. Bagula_, May 19 2004

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 July 30 12:09 EDT 2024. Contains 374743 sequences. (Running on oeis4.)