OFFSET
0,6
COMMENTS
A left-leaning AVL tree is a binary rooted tree where at any node, the height of left subtree is equal to the height of right subtree or greater by 1.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1000
Katarzyna Matylla, Python program for A296103
MAPLE
B:= proc(x, y, d, a, b) option remember; `if`(a+b<=d,
B(x^2+x*y, x, d, a+b, a)+x, x)
end:
a:= n-> coeff(B(z, 0, n+1, 1, 1), z, n+1):
seq(a(n), n=0..60); # Alois P. Heinz, Dec 05 2017
MATHEMATICA
B[x_, y_, d_, a_, b_] := B[x, y, d, a, b] = If[a + b <= d, B[x^2 + x*y, x, d, a + b, a] + x, x];
a[n_] := Coefficient[B[z, 0, n+1, 1, 1], z, n+1];
Table[a[n], {n, 0, 60}] (* Jean-François Alcover, May 31 2019, after Alois P. Heinz *)
PROG
(Python) # see link above
CROSSREFS
KEYWORD
nonn
AUTHOR
Katarzyna Matylla, Dec 04 2017
STATUS
approved