OFFSET
0,2
COMMENTS
If a(n) = a0, a1, a2, a3, ... then Sum(a(n))= a0, a0+a1, a0+a1+a2, a0+a1+a2+a3, ...
LINKS
Robert Israel, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).
FORMULA
a(n) = 1 + 3*n^2 + n*(5 + 4*n^2)/3.
G.f.: (1 + 3*x + 5*x^2 - x^3)/(1-x)^4.
a(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4). - Vincenzo Librandi, Jul 28 2015
From Robert Israel, Jul 28 2015: (Start)
E.g.f.: (1+6*x+7*x^2+(4/3)*x^3)*exp(x).
a(n) = 1 + Sum(A068377(i),i=1..n+1). (End)
EXAMPLE
a(0) = 1;
a(1) = 1 + 2*3 = 7;
a(2) = 1 + 2*3 + 4*5 = 27, etc.
MAPLE
seq((4/3)*n^3+3*n^2+(5/3)*n+1, n=0..100); # Robert Israel, Jul 28 2015
MATHEMATICA
Table[1 + 3 n^2 + n (5 + 4 n^2)/3, {n, 0, 40}] (* Robert G. Wilson v, Oct 23 2004 *)
LinearRecurrence[{4, -6, 4, -1}, {1, 7, 27, 69}, 40] (* Vincenzo Librandi, Jul 28 2015 *)
PROG
(Magma) [1+3*n^2+n*(5+4*n^2)/3: n in [0..40]]; // Vincenzo Librandi, Jul 28 2015
(PARI) a(n)=n*(4*n^2+9*n+5)/3+1 \\ Charles R Greathouse IV, Jul 28 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Miklos Kristof, Oct 20 2004
EXTENSIONS
Edited and extended by Robert G. Wilson v, Oct 23 2004
STATUS
approved