|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
LINKS
|
|
|
FORMULA
|
G.f.: x/(1-5*x-16*x^2).
|
|
MATHEMATICA
|
LinearRecurrence[{5, 16}, {0, 1}, 25] (* Paolo Xausa, Jan 29 2024 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|