OFFSET
0,2
LINKS
Harvey P. Dale, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
FORMULA
a(n) = 2*n^2 + 13*n.
a(n) = a(n-1) + 4*n + 11 (with a(0)=0). - Vincenzo Librandi, Nov 24 2010
From Elmo R. Oliveira, Nov 29 2024: (Start)
G.f.: x*(15 - 11*x)/(1 - x)^3.
E.g.f.: exp(x)*x*(15 + 2*x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)
MATHEMATICA
s=0; lst={s}; Do[s+=n++ +15; AppendTo[lst, s], {n, 0, 7!, 4}]; lst (* Vladimir Joseph Stephan Orlovsky, Nov 19 2008 *)
Table[n(2n+13), {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1}, {0, 15, 34}, 50] (* Harvey P. Dale, Nov 22 2014 *)
PROG
(PARI) a(n)=n*(2*n+13) \\ Charles R Greathouse IV, Oct 07 2015
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Omar E. Pol, May 19 2008
STATUS
approved