|
%I #18 Oct 31 2015 15:33:32
%S 1,1,2,1,4,7,1,8,26,34,1,16,115,179,209,1,32,542,1102,1402,1546,1,64,
%T 2809,7609,10759,12487,13327,1,128,15374,56534,92234,113402,125162,
%U 130922,1,256,89737,457993,865393,1139569,1304209,1396369,1441729
%N Triangle read by rows: T(n,k) is the number of subpermutations of an n-set whose orbits are each of size at most k.
%D A. Laradji and A. Umar, On the number of subpermutations with fixed orbit size, Ars Combinatoria, 109 (2013), 447-460.
%F T(n,n) = A002720(n).
%F T(n,k) = Sum_{i=0..n} binomial(n,i)*A261762(n-i,k).
%F E.g.f. of column k: exp(Sum_{j=1..k} (j+1)*x^j/j).
%e T(3, 2) = 26 because there are 26 subpermutations on {1,2,3}, each of whose orbit is of size at most 2, namely:
%e Empty map, 1-->1, 1-->2, 1-->3, 2-->1, 2-->2, 2-->3, 3-->1, 3-->2, 3-->3, (1,2) --> (1,2), (1,3) --> (1,3), (2,3) --> (2,3), (1,2) --> (2,1), (1,3) --> (3,1), (2,3) --> (3,2), (1,2) --> (1,3), (1,3) --> (1,2), (2,3) --> (2,1), (1,2) --> (3,2), (1,3) --> (2,3), (2,3) --> (1,3), (1,2,3) --> (1,3,2), (1,2,3) --> (3,2,1), (1,2,3) --> (2,1,3), (1,2,3) --> (1,2,3).
%e Triangle starts:
%e 1;
%e 1, 2;
%e 1, 4, 7;
%e 1, 8, 26, 34;
%e 1, 16, 115, 179, 209;
%e ...
%Y Cf. A157400, A261762, A261764, A261765, A261766, A261767.
%K nonn,tabl
%O 0,3
%A _Samira Stitou_, Sep 21 2015
%E More terms from _Alois P. Heinz_, Oct 07 2015
|
