|
%I #9 Mar 13 2018 04:45:10
%S 1,1,1,4,11,858,17214,14387280,16561934649,12632627296395920,
%T 1806607850839536160,60680518911947880747545184,
%U 3970597825550456048739497554530,2125765417629321139616806005661738101300,126059631064606828307362820570036049789588446100
%N The LCM of the n-th row of the triangle of Eulerian numbers, A008292.
%C Define the Eulerian numbers A(n,k) to be the number of permutations of {1,2,..,n} with k ascents: A(n,k) = Sum_{j=0..k} (-1)^j binomial(n+1,j)(k-j+1)^n.
%C Then a(n) = lcm(A(n,0), A(n,1), ..., A(n,n)).
%H Digital Library of Mathematical Functions, <a href="http://dlmf.nist.gov/26.14#T1">Table 26.14.1</a>
%o (PARI) a(n) = lcm(vector(n, k, sum(j=0, k, (-1)^j * (k-j)^n * binomial(n+1, j)))); \\ _Michel Marcus_, Mar 13 2018
%Y Cf. A008292.
%K nonn
%O 0,4
%A _Peter Luschny_, Aug 08 2010
%E Partially edited by _N. J. A. Sloane_, Aug 08 2010
%E More terms from _Michel Marcus_, Mar 13 2018
|
