OFFSET
0,12
COMMENTS
Number of compositions of n into parts 5 and 6. - Joerg Arndt, Jun 27 2013
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Vincenzo Librandi)
Johann Cigler, Recurrences for certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials, arXiv:2212.02118 [math.NT], 2022.
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,1,1).
FORMULA
a(n) = a(n-6) + a(n-5). - Jon E. Schoenfield, Aug 07 2006
MATHEMATICA
CoefficientList[Series[1 / (1 - Total[x^Range[5, 6]]), {x, 0, 50}], x] (* Vincenzo Librandi Jun 27 2013 *)
PROG
(PARI) Vec(1/(1-x^5-x^6)+O(x^99)) \\ Charles R Greathouse IV, Sep 26 2012
(Magma) m:=70; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!(1/(1-x^5-x^6))); /* or */ I:=[1, 0, 0, 0, 0, 1]; [n le 6 select I[n] else Self(n-5)+Self(n-6): n in [1..70]]; // Vincenzo Librandi, Jun 27 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved