|
Search: id:A072169
|
|
|
| A072169 |
|
Commuting permutations: number of ordered triples f, g, h in Symm(n) which all commute. |
|
+0
3
|
| |
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Computed by John McKay, Sep 06 2003
|
|
PROGRAM
|
(MAGMA) for n in {1 .. 5} do G := SymmetricGroup(n); t1 := 0; for g in G do for h in G do for i in G do if g*h eq h*g and g*i eq i*g and h*i eq i*h then t1 := t1+1; end if; end for; end for; end for; n, t1; end for;
|
|
CROSSREFS
|
Cf. A079860, A053529.
Sequence in context: A131681 A077708 A013186 this_sequence A052575 A108214 A010568
Adjacent sequences: A072166 A072167 A072168 this_sequence A072170 A072171 A072172
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
njas, Sep 06 2003
|
|
|
Search completed in 0.002 seconds
|
