OFFSET
3,1
COMMENTS
a(n) denotes the total number of descents of all paths starting from a vertex on the 2(n+1)-th floor in the 3-Bratteli diagram and ending at all vertices on the first floor.
LINKS
Tamilselvi Annamalai, Table of n, a(n) for n = 3..102
Wikipedia, Bratteli diagram.
Index entries for linear recurrences with constant coefficients, signature (6,-9).
FORMULA
a(n) = 3^(n-3)*(16*n-17).
G.f.: x^3*(31-45*x)/(1-3*x)^2.
E.g.f.: (34 + 6*x - 135*x^2 + exp(3*x)*(96*x - 34))/54. - Stefano Spezia, Feb 25 2026
MAPLE
a(n):= 3^(n - 3)*(16*n - 17);
num_list := [seq(eval(a(n), n = i), i = 3 .. 100)];
MATHEMATICA
LinearRecurrence[{6, -9}, {31, 141}, 26] (* Hugo Pfoertner, Feb 24 2026 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Tamilselvi Annamalai, Feb 24 2026
STATUS
approved
