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 A246292 #11 Jul 25 2018 15:01:27 %S A246292 1,1,3,120,151200,10897286400,70959641905152000, %T A246292 60493719168990845337600000,9226024969987629401488081551360000000, %U A246292 329646772667218349211759153151614073700352000000000,3498788402132461399351052923160966975192989707740695756800000000000 %N A246292 Number of permutations on [n*(n+1)/2] with cycles of n distinct lengths. %H A246292 Alois P. Heinz, <a href="/A246292/b246292.txt">Table of n, a(n) for n = 0..30</a> %F A246292 a(n) = C(n+1,2)! / n!. %F A246292 a(n) = A218868(n*(n+1)/2,n) = A218868(A000217(n),n). %F A246292 a(n) = A242027(n*(n+1)/2,n) = A242027(A000217(n),n). %F A246292 a(n) = A022915(n) * A000178(n-1) for n>0. %p A246292 a:= n-> binomial(n+1, 2)!/n!: %p A246292 seq(a(n), n=0..12); %Y A246292 Cf. A000142, A000178, A000217, A022915, A218868, A242027, A317165. %K A246292 nonn %O A246292 0,3 %A A246292 _Alois P. Heinz_, Aug 21 2014