|
Search: id:A071605
|
|
|
| A071605 |
|
Number of ordered pairs (a,b) of elements of the symmetric group S_n such that the pair a,b generates S_n. |
|
+0
5
|
|
| 1, 3, 18, 216, 6840, 228960, 15573600, 994533120, 85232891520
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Dixon, John D. The probability of generating the symmetric group. Math. Z. 110 1969 199-205.
J. D. Dixon, Problem 923 (BCC20.17), Indecomposable permutations and transitive groups, in Research Problems from the 20th Britsh Combinatorial Conference, Discrete Math., 308 (2008), 621-630.
|
|
FORMULA
|
Except for n=2 (because of the "replacement") in A040175, a(n) = n! * A040175(n)
|
|
CROSSREFS
|
Cf. A040175, A135474.
Sequence in context: A024488 A132727 A111841 this_sequence A137223 A038061 A128775
Adjacent sequences: A071602 A071603 A071604 this_sequence A071606 A071607 A071608
|
|
KEYWORD
|
nonn,more,nice
|
|
AUTHOR
|
Sharon Sela (sharonsela(AT)hotmail.com), Jun 02 2002
|
|
|
Search completed in 0.002 seconds
|
