proposed
approved
proposed
approved
editing
proposed
a(n) is the number of labeled trees with sum of the labels equal to n-1 and the outdegree of every node less than or equal to the value of its label. - Andrew Howroyd, Feb 02 2021
1, 1, 1, 3, 3, 5, 13, 15, 23, 34, 95, 106, 176, 241, 374, 942, 1129, 1760, 2515, 3711, 5136, 12857, 14911, 23814, 33002, 49141, 65798, 97056, 209707, 255042, 389725, 545290, 790344, 1071010, 1525919, 2043953, 4272124, 5110583, 7772247, 10611491, 15447864, 20496809
Andrew Howroyd, <a href="/A298478/b298478.txt">Table of n, a(n) for n = 1..100</a>
(PARI)
relabel(b)={my(w=hammingweight(b)); b = bitand((1<<w)-1, b); b + (((1 << (w-hammingweight(b))) - 1) << w)}
a(n)={local(M=Map());
my(recurse(b, k) = if(!b, 1, b=relabel(b); my(hk=[b, k], z); if(!mapisdefined(M, hk, &z),
z = if(k==0,
sum(i=1, logint(b, 2), if(bittest(b, i), self()(b-2^i, i-1))),
sum(f=2^logint(b, 2), b, if(!bitnegimply(f, b), self()(f, 0)*self()(b-f, k-1)));
);
mapput(M, hk, z)); z));
if( n==1, 1, my(t=0); for(np=1, sqrtint(2*n-2), forpart(p=n-1-binomial(np, 2), t+=recurse(sum(i=1, #p, 2^(p[i]+i-1)), 0), , [np, np])); t);
} \\ Andrew Howroyd, Feb 02 2021
nonn,more
nonn
Terms a(35) and beyond from Andrew Howroyd, Feb 02 2021
approved
editing
editing
approved
a(27) - a(34) from Robert G. Wilson v, Jan 19 2018
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
1, 1, 1, 3, 3, 5, 13, 15, 23, 34, 95, 106, 176, 241, 374, 942, 1129, 1760, 2515, 3711, 5136, 12857, 14911, 23814, 33002, 49141, 65798, 97056, 209707, 255042, 389725, 545290, 790344, 1071010
a(27) - a(34) from Robert G. Wilson v, Jan 19 2018
proposed
editing