OFFSET
0,3
COMMENTS
Number of n-vertex planar rooted trees with vertices colored red, blue, and green with red root where red vertices can be followed by vertices of any color, blue vertices can only be followed by blue vertices, and green vertices can only occur as leaves.
LINKS
Nathan Fox, Table of n, a(n) for n = 0..300
S. Dimitrov, N. Fox, K. Hadaway, A. Tharp, and S. Wagner, Counting Colored Trees, arXiv:2602.16055 [math.CO], 2026.
PROG
(Python)
def A394119(n):
A = [[1, 1, 1], [0, 1, 0], [0, 0, 0]]
if n == 0:
return 0
m = len(A)
output = [[1] for i in range(m)]
for l in range(2, n + 1):
for i in range(m):
term = 0
for k in range(1, l):
for j in range(m):
term += A[i][j] * output[i][k - 1] * output[j][l - k - 1]
output[i].append(term)
return output[0][n - 1]
CROSSREFS
KEYWORD
nonn
AUTHOR
Nathan Fox, Mar 11 2026
STATUS
approved
