OFFSET
0,4
COMMENTS
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.
Then a(n) = lcm(A(n,0), A(n,1), ..., A(n,n)).
LINKS
Digital Library of Mathematical Functions, Table 26.14.1
PROG
(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
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Aug 08 2010
EXTENSIONS
Partially edited by N. J. A. Sloane, Aug 08 2010
More terms from Michel Marcus, Mar 13 2018
STATUS
approved