OFFSET
1,3
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Dairyko, Michael; Tyner, Samantha; Pudwell, Lara; Wynn, Casey. Non-contiguous pattern avoidance in binary trees. Electron. J. Combin. 19 (2012), no. 3, Paper 22, 21 pp. MR2967227.
M. Dairyko, S. Tyner, L. Pudwell and C. Wynn, Non-contiguous pattern avoidance in binary trees, 2012, arXiv:1203.0795 [math.CO], p. 17 (Class B).
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
FORMULA
G.f. x*(1-2*x+2*x^2+x^3+2*x^4+3*x^5+2*x^6+2*x^7+x^8)/(1-x)^3.
a(n) = 6*n^2 - 56*n + 147 for n>6. [Bruno Berselli, Feb 05 2013]
MATHEMATICA
CoefficientList[Series[(1 - 2 x + 2 x^2 + x^3 + 2 x^4 + 3 x^5 + 2 x^6 + 2 x^7 + x^8) / (1 - x)^3, {x, 0, 40}], x] (* Vincenzo Librandi, Jun 19 2013 *)
LinearRecurrence[{3, -3, 1}, {1, 1, 2, 5, 12, 26, 49, 83, 129}, 50] (* Harvey P. Dale, Sep 04 2021 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Feb 01 2013
STATUS
approved