OFFSET
0,3
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
D. Callan, T. Mansour, Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns, arXiv:1705.00933 [math.CO] (2017), Table 2 No 4.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).
FORMULA
From Colin Barker, Nov 10 2017: (Start)
G.f.: (1 - 4*x + 7*x^2 - 4*x^3 + 6*x^4 + 8*x^5 + 4*x^6 + 4*x^7 + 6*x^8 - 6*x^9 + 2*x^10) / (1 - x)^5.
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n>10.
a(n) = (1/6)*(786 - 787*n + 333*n^2 - 68*n^3 + 6*n^4) for n>5.
(End)
MAPLE
cn := [1, -4, 7, -4, 6, 8, 4, 4, 6, -6, 2] ;
p := add(cn[i]*x^(i-1), i=1..nops(cn)) ;
q := (1-x)^5 ;
taylor(p/q, x=0, 40) ;
gfun[seriestolist](%) ;
PROG
(PARI) Vec((1 - 4*x + 7*x^2 - 4*x^3 + 6*x^4 + 8*x^5 + 4*x^6 + 4*x^7 + 6*x^8 - 6*x^9 + 2*x^10) / (1 - x)^5 + O(x^40)) \\ Colin Barker, Nov 10 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
R. J. Mathar, Nov 07 2017
STATUS
approved