|
|
A180057
|
|
The LCM of the n-th row of the triangle of Eulerian numbers, A008292.
|
|
0
|
|
|
1, 1, 1, 4, 11, 858, 17214, 14387280, 16561934649, 12632627296395920, 1806607850839536160, 60680518911947880747545184, 3970597825550456048739497554530, 2125765417629321139616806005661738101300, 126059631064606828307362820570036049789588446100
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
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
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|