The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A252751 Partial sums of A252750: a(0) = 0; for >= 1: a(n) = A252750(n) + a(n-1). 4

%I

%S 0,-1,-2,-1,-4,-1,6,17,14,15,20,41,40,79,150,199,190,195,208,231,238,

%T 283,368,455,478,525,620,773,866,1133,1596,1775,1766,1761,1760,1803,

%U 1784,1865,2014,2123,2112,2203,2378,2573,2762,3107,3712,4021,3948,4115,4426,4667,5024,5459,6234,6765,7410,7939,8904,9813,10964,12515,15154,15755,15740

%N Partial sums of A252750: a(0) = 0; for >= 1: a(n) = A252750(n) + a(n-1).

%H Antti Karttunen, <a href="/A252751/b252751.txt">Table of n, a(n) for n = 0..8191</a>

%F a(0) = 0; for >= 1: a(n) = A252750(n) + a(n-1).

%o (Scheme, with memoization macro definec)

%o (definec (A252751 n) (if (zero? n) n (+ (A252750 n) (A252751 (- n 1)))))

%Y Cf. A252750, A252749.

%K sign

%O 0,3

%A _Antti Karttunen_, Dec 21 2014

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

Last modified September 19 21:33 EDT 2020. Contains 337183 sequences. (Running on oeis4.)