OFFSET
2,1
LINKS
Bruno Berselli, Table of n, a(n) for n = 2..1000
Jan Draisma, Emil Horobeţ, Giorgio Ottaviani, Bernd Sturmfels, and Rekha R. Thomas, The Euclidean distance degree of an algebraic variety, Foundations of computational mathematics, Vol. 16 (2016), pp. 99-149; arXiv preprint, arXiv:1309.0049 [math.AG], 2013-2014. See Conjecture 3.4.
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).
FORMULA
G.f.: x^2*(6 + 23*x - 4*x^2 + 2*x^3) / (1 - x)^4. - Bruno Berselli, Dec 03 2013
MATHEMATICA
Table[9 n^3/2 - 21 n^2/2 + 8 n - 4, {n, 2, 40}] (* Bruno Berselli, Dec 03 2013 *)
LinearRecurrence[{4, -6, 4, -1}, {6, 47, 148, 336}, 40] (* Harvey P. Dale, Aug 03 2020 *)
PROG
(Magma) [9*n^3/2-21*n^2/2+8*n-4: n in [2..40]]; // Bruno Berselli, Dec 03 2013
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
N. J. A. Sloane, Dec 03 2013
STATUS
approved