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 A224900 #38 Apr 22 2024 07:35:53
%S A224900 1,4,72,3456,345600,62208000,18289152000,8193540096000,
%T A224900 5309413982208000,4778472583987200000,5781951826624512000000,
%U A224900 9158611693373227008000000,18573664514160904372224000000,47325697182081984340426752000000,149075946123558250672344268800000000
%N A224900 a(n) = n!*((n+1)!)^2.
%C A224900 2*a(n-1) is the number of elements of the wreath product of S_n and S_3 with cycle partition equal to (3n). - _Josaphat Baolahy_, Mar 12 2024
%F A224900 G.f. of hypergeometric type: Sum_{n>=0} a(n)*z^n/(n!)^3 = (1+z)/(1-z)^3.
%F A224900 Integral representation as n-th moment of a positive function w(x) on a positive half axis (solution of the Stieltjes moment problem), in Maple notation: a(n) = int(x^n*w(x),x=0..infinity), n>=0, where w(x) = MeijerG([[],[]],[[1,1,0]],[]],x), w(0)=1, limit(w(x),x=infinity)=0.
%F A224900 w(x) is monotonically decreasing over (0,infinity).
%F A224900 The Meijer G function above cannot be represented by any other known special function.
%F A224900 This solution of the Stieltjes moment problem is not unique.
%F A224900 Asymptotics: a(n) -> (1/960)*sqrt(2)*Pi^(3/2)*(1920*n^3 + 4320*n^2 + 2940*n + 589)*exp(-3*n)*n^(1/2 + 3*n), for n->oo.
%F A224900 a(n) = A172492(n)*(n+1).
%F A224900 a(n) - n*(n+1)^2*a(n-1) = 0. - _R. J. Mathar_, Jul 28 2013
%t A224900 Table[n!*((n+1)!)^2,{n,0,15}]
%o A224900 (Python)
%o A224900 from math import factorial
%o A224900 def A224900(n): return factorial(n)**3*(n+1)**2 # _Chai Wah Wu_, Apr 22 2024
%Y A224900 Cf. A172492.
%K A224900 nonn,easy
%O A224900 0,2
%A A224900 _Karol A. Penson_, Jul 24 2013