OFFSET
0,2
COMMENTS
a(n) is the number of weak compositions of n with exactly 7 parts equal to 0. - Milan Janjic, Jun 27 2010
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Nickolas Hein, Jia Huang, Variations of the Catalan numbers from some nonassociative binary operations, arXiv:1807.04623 [math.CO], 2018.
M. Janjic and B. Petkovic, A Counting Function, arXiv 1301.4550 [math.CO], 2013.
M. Janjic, B. Petkovic, A Counting Function Generalizing Binomial Coefficients and Some Other Classes of Integers, J. Int. Seq. 17 (2014) # 14.3.5.
Index entries for linear recurrences with constant coefficients, signature (16, -112, 448, -1120, 1792, -1792, 1024, -256).
FORMULA
G.f.: ((1-x)/(1-2*x))^8.
For n > 0, a(n) = 2^(n-12)*(n+9) * (n^6 + 75*n^5 + 1999*n^4 + 23169*n^3 + 115768*n^2 + 232284*n + 142800)/315. - Bruno Berselli, Aug 07 2011
MATHEMATICA
CoefficientList[Series[((1-x)/(1-2x))^8, {x, 0, 30}], x] (* Harvey P. Dale, Nov 24 2016 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 15 2010
STATUS
approved