close
login
A394411
Number of ordered rooted trees with node weights summing to n such that the root has weight 0, non-root nodes have positive integer weights, and no two adjacent sibling nodes have the same weight.
1
1, 1, 2, 6, 17, 50, 155, 492, 1588, 5218, 17388, 58589, 199331, 683847, 2362995, 8216709, 28730796, 100958534, 356334303, 1262698652, 4490603094, 16022496932, 57339328443, 205761281668, 740232427023, 2669203547118, 9645606244577, 34925670593132, 126697320335584
OFFSET
0,3
FORMULA
G.f.: C(x) satisfies C(x) = 1/(1 - C(x) * Sum_{k>0} (x^k/(1 + x^k*C(x)))).
PROG
(PARI) C_x(N) = {my(x='x+O('x^(N+1)), A=1); for(i=1, N, A= 1/(1 - sum(k=1, N, x^k*A/(1 + x^k*A)))); Vec(A)}
CROSSREFS
Row sums of A393235.
Sequence in context: A027914 A098703 A025272 * A356783 A148447 A148448
KEYWORD
nonn
AUTHOR
John Tyler Rascoe, Mar 19 2026
STATUS
approved