|
Search: id:A008307
|
|
|
| A008307 |
|
Table T(n,k) giving number of permutations of [1..n] with order dividing k, read by antidiagonals. |
|
+0
1
|
|
| 1, 1, 1, 1, 2, 1, 1, 4, 1, 1, 1, 10, 3, 2, 1, 1, 26, 9, 4, 1, 1, 1, 76, 21, 16, 1, 2, 1, 1, 232, 81, 56, 1, 6, 1, 1, 1, 764, 351, 256, 25, 18, 1, 2, 1, 1, 2620, 1233, 1072, 145, 66, 1, 4, 1, 1, 1, 9496, 5769, 6224, 505, 396, 1, 16, 3, 2, 1, 1, 35696, 31041, 33616, 1345, 2052, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Solutions to x^k = 1 in Symm_n.
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 257.
|
|
FORMULA
|
T(n+1, k) = Sum_{d|k} (n)_{d-1}*T(n-d+1, k), where (n)_i = n*(n-1)*(n-2)*...*(n-i+1).
Sum_{n >= 0} T(n, k)*t^n/n! = exp( sum_{d|k} t^d/d ).
|
|
EXAMPLE
|
Array begins
1 1 1 1 1 1 ...
1 2 1 2 1 2 ...
1 4 9 4 1 6 ...
1 10 9 16 1 ...
1 26 21 56 25 ...
|
|
CROSSREFS
|
Rows give A056595, (more sequences needed!), columns give A000085, A001470, A001472, A052501, A053496-A053505.
Adjacent sequences: A008304 A008305 A008306 this_sequence A008308 A008309 A008310
Sequence in context: A106246 A136674 A064645 this_sequence A099238 A141450 A061462
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 13 2001
|
|
|
Search completed in 0.002 seconds
|
