This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A072169 #20 May 09 2023 11:41:06
%S A072169 1,1,8,48,504,4680,66240,856800,14515200,242040960,4775500800,
%T A072169 95520902400,2175146265600,50438868480000,1292330988748800,
%U A072169 34092378448128000,971277752180736000,28566680100102144000,896191466580393984000,29029508406664077312000
%N A072169 Commuting permutations: number of ordered triples of permutations f, g, h in Symm(n) which all commute.
%D A072169 a(1)-a(7) computed by John McKay, Sep 06 2003.
%H A072169 T. D. Noe, <a href="/A072169/b072169.txt">Table of n, a(n) for n = 0..200</a>
%F A072169 Equals A061256(n)*n!.
%t A072169 nn = 20; b = Table[DivisorSigma[1, n], {n, nn}]; Range[0, nn]! CoefficientList[Series[Product[1/(1 - x^m)^b[[m]], {m, nn}], {x, 0, nn}], x] (* _T. D. Noe_, Jun 19 2012 *)
%o A072169 (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;
%Y A072169 Column k=3 of A362827.
%Y A072169 Cf. A061256, A053529.
%K A072169 nonn
%O A072169 0,3
%A A072169 _N. J. A. Sloane_, Sep 06 2003. More terms from A061256 from _N. J. A. Sloane_, Jun 13 2012