OFFSET
0,2
LINKS
Todd Silvestri, Table of n, a(n) for n = 0..1660
A. Prasad, Equivalence classes of nodes in trees and rational generating functions, arXiv:1407.5284 [math.CO], 2014.
Index entries for linear recurrences with constant coefficients, signature (10,-35,50,-24).
FORMULA
a(n) = (3^(n+1)+7*4^n-3*2^n-1)/6. - Todd Silvestri, Nov 16 2014
MATHEMATICA
a[n_Integer/; n>=0]:=(3^(n+1)+7*4^n-3*2^n-1)/6 (* Todd Silvestri, Nov 16 2014 *)
CoefficientList[Series[(1 - 5 t + 6 t^2 - t^3) / ((1 - t) (1 - 2 t) (1 - 3 t) (1 - 4 t)), {t, 0, 40}], t] (* Vincenzo Librandi, Nov 16 2014 *)
LinearRecurrence[{10, -35, 50, -24}, {1, 5, 21, 84}, 30] (* Harvey P. Dale, May 12 2017 *)
PROG
(Magma) [(3^(n+1)+7*4^n-3*2^n-1)/6: n in [0..30]]; // Vincenzo Librandi, Nov 16 2014
(PARI) Vec((1-5*x+6*x^2-x^3)/((1-x)*(1-2*x)*(1-3*x)*(1-4*x)) + O(x^30)) \\ Michel Marcus, Jan 14 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Sep 15 2014
STATUS
approved