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 A060015 #15 Oct 14 2023 13:19:13
%S A060015 1,1,7,31,211,1411,12601,137047,1516831,18111751,223179001,2973194071,
%T A060015 46287964867,835826439631,15722804528341,292673102609791,
%U A060015 5177400032329231,102538737981192607,2284570602107946601
%N A060015 Sum of orders of all even permutations of n letters.
%H A060015 Joshua Harrington, Lenny Jones, and Alicia Lamarche, <a href="http://dx.doi.org/10.1155/2014/835125">Characterizing Finite Groups Using the Sum of the Orders of the Elements</a>, International Journal of Combinatorics, Volume 2014, Article ID 835125, 8 pages.
%e A060015 For n = 4 there is 1 even permutation (1) of order 1, 3 even permutations (12)(34) etc. of order 2 and 8 (123) etc. of order 3, for a total of 31.
%t A060015 g[list_]:=Total[list]!/Apply[Times,list]/Apply[Times,Table[Count[list,n]!,{n,1,20}]];f[list_]:=Apply[Plus,Table[Count[list,n],{n,2,20,2}]];Map[Total,Table[Map[g,Select[Partitions[n],EvenQ[f[#]]&]]*Map[Apply[LCM,#]&,Select[Partitions[n],EvenQ[f[#]]&]],{n,1,20}]] (* _Geoffrey Critzer_, Mar 26 2013 *)
%Y A060015 Cf. A060014.
%K A060015 nonn,nice,easy
%O A060015 1,3
%A A060015 _N. J. A. Sloane_, Mar 17 2001
%E A060015 More terms from _Vladeta Jovovic_, Mar 18 2001