|
%I #9 Jul 06 2023 06:57:45
%S 0,0,0,1,0,0,0,3,0,0,6,0,6,0,0,20,30,0,10,0,0,135,120,90,0,15,0,0,924,
%T 945,420,210,0,21,0,0,7420,7392,3780,1120,420,0,28,0,0,66744,66780,
%U 33264,11340,2520,756,0,36,0,0
%N T(n,k) is the number of odd permutations (of an n-set) with exactly k fixed points.
%H Bashir Ali and A. Umar, <a href="http://www.seams-bull-math.ynu.edu.cn/downloadfile.jsp?filemenu=_200805&filename=Some Combinatorial Properties of the Alternating Group.pdf">Some combinatorial properties of the alternating group</a>, Southeast Asian Bulletin Math. 32 (2008), 823-830.
%F T(n,k) = C(n,k)*A000387(n-k)
%F E.g.f.: (x^(k+2)*exp(-x))/(2*(k!)*(1-x)).
%F T(n,k) + A145224(n,k) = A008290(n,k). - _R. J. Mathar_, Jul 06 2023
%e Triangle starts:
%e 0;
%e 0, 0;
%e 1, 0, 0;
%e 0, 3, 0, 0;
%e 6, 0, 6, 0, 0;
%e 20, 30, 0, 10, 0;
%e ...
%p A145225 := proc(n,k)
%p binomial(n,k)*A000387(n-k) ; # re-use code of A000387
%p end proc:
%p seq(seq(A145225(n,k),k=0..n),n=0..12) ; # _R. J. Mathar_, Jul 06 2023
%Y Row sum is A001710 for n > 1, sum of Row1=sum of Row2 = 0.
%Y T(n, 0) is A000387, T(n, 1) is A145222, T(n, 2) is A145223.
%K nonn,tabl
%O 0,8
%A _Abdullahi Umar_, Oct 10 2008
|
