cp's OEIS Frontend

A228094 Triangle starting at row 3 read by rows of the number of permutations in the n-th Dihedral group which are the product of k disjoint cycles, d(n,k), n >= 3, 1 <= k <= n.

%I A228094 #32 Feb 16 2025 08:33:20
%S A228094 2,3,1,2,3,2,1,4,0,5,0,1,2,2,4,3,0,1,6,0,0,7,0,0,1,4,2,0,5,4,0,0,1,6,
%T A228094 0,2,0,9,0,0,0,1,4,4,0,0,6,5,0,0,0,1,10,0,0,0,0,11,0,0,0,0,1,4,2,2,2,
%U A228094 0,7,6,0,0,0,0,1,12,0,0,0,0,0,13,0,0,0,0,0,1
%N A228094 Triangle starting at row 3 read by rows of the number of permutations in the n-th Dihedral group which are the product of k disjoint cycles, d(n,k), n >= 3, 1 <= k <= n.
%C A228094 The multivariable row polynomials give n times the cycle index for the Dihedral group D_n, called Z(D_n) (see the MathWorld link with the Harary reference). For example, 12*Z(D_6) = 2*(y_6)^1 + 2*(y_3)^2 + 4*(y_2)^3+3*(y_1)^2*(y_2)^2 + 1*(y_1)^6.
%D A228094 Robert A. Beeler, How to Count: An Introduction to Combinatorics and Its Applications, Springer International Publishing, 2015. See Theorem 8.4.12 at pp. 246-247.
%D A228094 Frank Harary and Edgar M. Palmer, Graphical Enumeration, Academic Press, 1973, p. 37.
%H A228094 Stefano Spezia, <a href="/A228094/b228094.txt">First 150 rows of the triangle, flattened</a>
%H A228094 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CycleIndex.html">Cycle Index</a>.
%F A228094 d(n,k) = A054523(n,k) + d'(n,k), where: If n is odd, then d'(n,k)= n when k=(n+1)/2 and d'(n,k)=0 otherwise. If n is even, then d'(n,k)=n/2 when k=n/2, (n+2)/2 and d'(n,k)=0 otherwise.
%e A228094 Triangle begins
%e A228094    2, 3, 1;
%e A228094    2, 3, 2, 1;
%e A228094    4, 0, 5, 0, 1;
%e A228094    2, 2, 4, 3, 0,  1;
%e A228094    6, 0, 0, 7, 0,  0, 1;
%e A228094    4, 2, 0, 5, 4,  0, 0, 1;
%e A228094    6, 0, 2, 0, 9,  0, 0, 0, 1;
%e A228094    4, 4, 0, 0, 6,  5, 0, 0, 0, 1;
%e A228094   10, 0, 0, 0, 0, 11, 0, 0, 0, 0, 1;
%e A228094    4, 2, 2, 2, 0,  7, 6, 0, 0, 0, 0, 1;
%e A228094    ...
%t A228094 d[n_,k_]:=If[Divisible[n,k],EulerPhi[n/k],0]+If[OddQ[n]&&k==(n+1)/2,n,If[EvenQ[n]&&(k==n/2||k==(n+2)/2),n/2,0]]; Table[d[n,k],{n,3,12},{k,n}]//Flatten (* _Stefano Spezia_, Jun 26 2023 *)
%Y A228094 Cf. A000010, A054523, A130534.
%K A228094 nonn,tabf
%O A228094 3,1
%A A228094 _Robert A. Beeler_, Aug 09 2013
%E A228094 Terms corrected by _Stefano Spezia_, Jun 30 2023