OFFSET
0,2
COMMENTS
Parametric representation of the solution is (x, y, z) = (6n^3, 3n^3, 3n^2), thus getting a(n) = 9n^3 + 3n^2.
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).
FORMULA
a(n) = 9*n^3 + 3*n^2.
From Colin Barker, Oct 25 2019: (Start)
G.f.: 6*x*(2 + 6*x + x^2) /(1 - x)^4.
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>3.
(End)
From Amiram Eldar, Jan 10 2023: (Start)
Sum_{n>=1} 1/a(n) = Pi^2/18 + sqrt(3)*Pi/6 + 3*log(3)/2 - 3.
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/36 - Pi/sqrt(3) - 2*log(2) + 3. (End)
MATHEMATICA
Table[9n^3 + 3n^2, {n, 0, 34}]
PROG
(PARI) concat(0, Vec(6*x*(2 + 6*x + x^2) /(1 - x)^4 + O(x^40))) \\ Colin Barker, Oct 25 2019
(Magma) R<x>:=PowerSeriesRing(Integers(), 40); [0] cat Coefficients(R!( 6*x*(2 + 6*x + x^2) /(1 - x)^4)); // Marius A. Burtea, Oct 25 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Aug 13 2003
EXTENSIONS
More terms from Robert G. Wilson v, Aug 16 2003
STATUS
approved