login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A136786
Number of primitive multiplex juggling sequences of length n, base state <2,1> and hand capacity 3.
2
1, 4, 21, 111, 592, 3171, 17021, 91456, 491641, 2643523, 14215596, 76448559, 411134641, 2211076788, 11891207045, 63951270079, 343932277888, 1849681481203, 9947663349453, 53498950981392, 287719621233865, 1547368337500659, 8321812723167356, 44755063012476127
OFFSET
1,2
LINKS
S. Butler and R. Graham, Enumerating (multiplex) juggling sequences, arXiv:0801.2597 [math.CO], 2008.
FORMULA
G.f.: (x-5*x^2+7*x^3-3*x^4)/(1-9*x+22*x^2-13*x^3-3*x^4).
a(n) = 9*a(n-1)-22*a(n-2)+13*a(n-3)+3*a(n-4) for n>4. - Colin Barker, Aug 31 2016
MATHEMATICA
LinearRecurrence[{9, -22, 13, 3}, {1, 4, 21, 111}, 30] (* Harvey P. Dale, Feb 13 2022 *)
PROG
(PARI) Vec((x-5*x^2+7*x^3-3*x^4)/(1-9*x+22*x^2-13*x^3-3*x^4) + O(x^30)) \\ Colin Barker, Aug 31 2016
CROSSREFS
Cf. A136785.
Sequence in context: A100237 A117381 A010908 * A301972 A026335 A027909
KEYWORD
nonn,easy
AUTHOR
Steve Butler, Jan 21 2008
STATUS
approved