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”).

A155455
a(n) = 5*a(n-1)+16*a(n-2), n>1 ; a(0)=0, a(1)=1.
0
0, 1, 5, 41, 285, 2081, 14965, 108121, 780045, 5630161, 40631525, 293240201, 2116305405, 15273370241, 110227737685, 795512612281, 5741206864365, 41434236118321, 299030490421445, 2158100230000361, 15574988996744925, 112404548663730401, 811222567266570805
OFFSET
0,3
COMMENTS
a(n+1) for n >= 0 is the number of compositions (ordered partitions) of n into parts 1 of 5 sorts and parts 2 of 16 sorts. - Joerg Arndt, Jan 29 2024
FORMULA
G.f.: x/(1-5*x-16*x^2).
MATHEMATICA
LinearRecurrence[{5, 16}, {0, 1}, 25] (* Paolo Xausa, Jan 29 2024 *)
CROSSREFS
Cf. A015568 (binomial transform).
Sequence in context: A083300 A308247 A223009 * A218349 A154577 A198688
KEYWORD
nonn,easy
AUTHOR
Philippe Deléham, Jan 22 2009
EXTENSIONS
Regularized: a(0) set to 0. - R. J. Mathar, Apr 01 2011
a(21)-a(22) from Paolo Xausa, Jan 29 2024
STATUS
approved