|
%I #17 Feb 10 2020 06:14:11
%S 1,2,3,10,35,150,707,3700,20470,119260,719341,4466316,28367118,
%T 183620874,1207563011,8049914664,54295152117,369981325578,
%U 2544017965638,17633790542978,123108792874528,865045359778662,6114040341515978,43443726772579152,310195170229429300
%N Number of spanning hypertrees with n unlabeled vertices: analog of A035053 when edges of size 1 are allowed (with no two equal edges).
%H Andrew Howroyd, <a href="/A134959/b134959.txt">Table of n, a(n) for n = 0..200</a>
%F Inverse Euler transform of A134957. - _Gus Wiseman_, May 20 2018
%e From _Gus Wiseman_, May 20 2018: (Start)
%e Non-isomorphic representatives of the a(3) = 10 hypertrees are the following:
%e {{1,2,3}}
%e {{3},{1,2,3}}
%e {{1,3},{2,3}}
%e {{2},{3},{1,2,3}}
%e {{2},{1,3},{2,3}}
%e {{3},{1,3},{2,3}}
%e {{1},{2},{3},{1,2,3}}
%e {{1},{2},{1,3},{2,3}}
%e {{2},{3},{1,3},{2,3}}
%e {{1},{2},{3},{1,3},{2,3}}
%e (End)
%t etr[p_] := Module[{b}, b[n_] := b[n] = If[n == 0, 1, Sum[Sum[d*p[d], {d, Divisors[j]}]*b[n - j], {j, 1, n}]/n]; b];
%t EulerT[v_List] := With[{q = etr[v[[#]] &]}, q /@ Range[Length[v]]];
%t ser[v_] := Sum[v[[i]] x^(i - 1), {i, 1, Length[v]}] + O[x]^Length[v];
%t b[n_] := Module[{v = {1}}, For[i = 2, i <= n, i++, v = Join[{1}, EulerT[EulerT[2 v]]]]; v];
%t seq[n_] := Module[{u = 2 b[n]}, 1 + x*ser[EulerT[u]]*(1 - x*ser[u]) + O[x]^n // CoefficientList[#, x]&];
%t seq[25] (* _Jean-François Alcover_, Feb 10 2020, after _Andrew Howroyd_ *)
%o (PARI) \\ here b(n) is A318494 as vector
%o EulerT(v)={Vec(exp(x*Ser(dirmul(v,vector(#v,n,1/n))))-1, -#v)}
%o b(n)={my(v=[1]); for(i=2, n, v=concat([1], EulerT(EulerT(2*v)))); v}
%o seq(n)={my(u=2*b(n)); Vec(1 + x*Ser(EulerT(u))*(1-x*Ser(u)))} \\ _Andrew Howroyd_, Aug 27 2018
%Y Cf. A030019, A035053, A048143, A054921, A134955, A134957, A144959, A304867, A304911, A318494.
%K nonn
%O 0,2
%A _Don Knuth_, Jan 26 2008
%E Terms a(7) and beyond from _Andrew Howroyd_, Aug 27 2018
|
