|
%I #19 Mar 30 2016 15:13:05
%S 1,2,12,9,156,100,80,56,3160,1880,1180,1420,950,1360,890,660,480,
%T 87990,50496,29682,35382,24042,22008,14928,31968,20268,14988,10848,
%U 34974,21474,13314,15114,10974,13014,8874,6534,5094,3218628,1806476,1021552,588756,1189132
%N Triangle T(n,k) in which n-th row lists the values of the n-th derivative at x=1 of all functions that are representable as x^x^...^x with n x's and parentheses inserted in all possible ways; n>=1, 1<=k<=A000081(n).
%C The ordering of the functions is the same as in A215703 and is defined by the algorithm below.
%H Alois P. Heinz, <a href="/A216349/b216349.txt">Rows n = 1..12, flattened</a>
%e For n=4 the A000081(4) = 4 functions and their 4th derivatives at x=1 are x^(x^3)->156, x^(x^x*x)->100, x^(x^(x^2))->80, x^(x^(x^x))->56.
%e Triangle T(n,k) begins:
%e : 1;
%e : 2;
%e : 12, 9;
%e : 156, 100, 80, 56;
%e : 3160, 1880, 1180, 1420, 950, 1360, 890, 660, 480;
%e : 87990, 50496, 29682, 35382, 24042, 22008, 14928, 31968, 20268, ...
%p with(combinat):
%p F:= proc(n) F(n):= `if`(n<2, [x$n], map(h->x^h, g(n-1, n-1))) end:
%p g:= proc(n, i) option remember; `if`(n=0 or i=1, [x^n],
%p `if`(i<1, [], [seq(seq(seq(mul(F(i)[w[t]-t+1], t=1..j)*v,
%p w=choose([$1..nops(F(i))+j-1], j)), v=g(n-i*j, i-1)), j=0..n/i)]))
%p end:
%p T:= n-> map(f-> n!*coeff(series(subs(x=x+1, f), x, n+1), x, n), F(n))[]:
%p seq(T(n), n=1..7);
%Y First column gives: A216351.
%Y Last elements of rows give: A033917.
%Y A version with sorted row elements is: A216350.
%Y Rows sums give: A216281.
%Y Cf. A000081, A215703.
%K nonn,look,tabf
%O 1,2
%A _Alois P. Heinz_, Sep 04 2012
|
