|
Search: id:A057741
|
|
|
| A057741 |
|
Table T(n,k) giving number of elements of order k in dihedral group D_{2n} of order 2n, n >= 1, 1<=k<=g(n), where g(n) = 2 if n=1 else g(n) = n. |
|
+0
3
|
|
| 1, 1, 1, 3, 1, 3, 2, 1, 5, 0, 2, 1, 5, 0, 0, 4, 1, 7, 2, 0, 0, 2, 1, 7, 0, 0, 0, 0, 6, 1, 9, 0, 2, 0, 0, 0, 4, 1, 9, 2, 0, 0, 0, 0, 0, 6, 1, 11, 0, 0, 4, 0, 0, 0, 0, 4, 1, 11, 0, 0, 0, 0, 0, 0, 0, 0, 10, 1, 13, 2, 2, 0, 2, 0, 0, 0, 0, 0, 4, 1, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 1, 15, 0, 0, 0, 0, 6, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Note that D_2 equals the cyclic group of order 2.
|
|
FORMULA
|
If k<>2 and k does not divide n, this number is 0; if k<>2 and k divides n, this number is phi(k), where phi is the Euler totient function; if k=2, this number is n for odd n and n+1 for even n.
|
|
EXAMPLE
|
1,1; 1,3; 1,3,2; 1,5,0,2; 1,5,0,0,4; ...
|
|
CROSSREFS
|
Cf. A057731, A054522, A057740.
Sequence in context: A099906 A047787 A102668 this_sequence A133571 A083208 A126682
Adjacent sequences: A057738 A057739 A057740 this_sequence A057742 A057743 A057744
|
|
KEYWORD
|
nonn,tabf,easy,nice
|
|
AUTHOR
|
Roger CUCULIERE (cuculier(AT)imaginet.fr), Oct 29 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Oct 30 2000
|
|
|
Search completed in 0.002 seconds
|
