|
%I #12 May 10 2021 07:40:46
%S 1,1,4,32,402,7038,160114,4522578,153640590,6132546770,282517271694,
%T 14812447505646,873934551644074,57486823088667270,4183353479821220130,
%U 334572221351085006242,29242220614539638127294,2779426070382982579163202,286058737295150226682469518
%N Fixed point of a shifted hypertree transform.
%C The hypertree transform H(a) of a sequence a is given by H(a)(n) = Sum_p n^(k-1) Prod_i a(|p_i|+1), where the sum is over all set partitions U(p_1, ..., p_k) = {1, ..., n-1}.
%H Alois P. Heinz, <a href="/A317677/b317677.txt">Table of n, a(n) for n = 1..305</a>
%p b:= proc(n, k) option remember; `if`(n=0, 1/k, add(
%p a(j)*b(n-j, k)*binomial(n-1, j-1)*k, j=1..n))
%p end:
%p a:= n-> b(n-1, n):
%p seq(a(n), n=1..20); # _Alois P. Heinz_, Aug 21 2019
%t numSetPtnsOfType[ptn_]:=Total[ptn]!/Times@@Factorial/@ptn/Times@@Factorial/@Length/@Split[ptn];
%t a[n_]:=a[n]=Sum[n^(Length[ptn]-1)*numSetPtnsOfType[ptn]*Product[a[s],{s,ptn}],{ptn,IntegerPartitions[n-1]}];
%t Array[a,20]
%t (* Second program: *)
%t b[n_, k_] := b[n, k] = If[n == 0, 1/k, Sum[
%t a[j]*b[n - j, k]*Binomial[n - 1, j - 1]*k, {j, 1, n}]];
%t a[n_] := b[n - 1, n];
%t Array[a, 20] (* _Jean-François Alcover_, May 10 2021, after _Alois P. Heinz_ *)
%Y Cf. A000272, A030019, A048143, A134954, A275307, A293510, A317631, A317632, A317634, A317635, A317671.
%K nonn,eigen
%O 1,3
%A _Gus Wiseman_, Aug 04 2018
|
