login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A067389
a(n) = 3*n^3 + 2*n^2 + n.
3
0, 6, 34, 102, 228, 430, 726, 1134, 1672, 2358, 3210, 4246, 5484, 6942, 8638, 10590, 12816, 15334, 18162, 21318, 24820, 28686, 32934, 37582, 42648, 48150, 54106, 60534, 67452, 74878, 82830, 91326, 100384, 110022, 120258, 131110, 142596
OFFSET
0,2
FORMULA
a(n) = n*A056109(n) = A045991(n+1)+A033431(n). - Henry Bottomley, Jan 25 2002
From Chai Wah Wu, Apr 25 2017: (Start)
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n > 3.
G.f.: 2*x*(x^2 + 5*x + 3)/(x - 1)^4. (End)
MAPLE
a:=n->n+2*n^2+3*n^3: seq(a(n), n=0..36); # Zerinvary Lajos, Oct 05 2007
MATHEMATICA
Table[3*n^3+2*n^2+n, {n, 0, 80}] (* Vladimir Joseph Stephan Orlovsky, May 07 2011 *)
LinearRecurrence[{4, -6, 4, -1}, {0, 6, 34, 102}, 40] (* Harvey P. Dale, Oct 01 2019 *)
PROG
(Magma) [3*n^3 + 2*n^2 + n: n in [0..60]]; // Vincenzo Librandi, May 08 2011
CROSSREFS
Sequence in context: A296808 A319199 A305164 * A281057 A341290 A061616
KEYWORD
nonn,easy
AUTHOR
George E. Antoniou, Jan 21 2002
EXTENSIONS
More terms from Henry Bottomley, Jan 25 2002
STATUS
approved