login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Table of n, a(n) for n=0..14.

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

Cf. A008292.

Sequence in context: A216571 A299046 A113314 * A222316 A255383 A218858

Adjacent sequences:  A180054 A180055 A180056 * A180058 A180059 A180060

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified April 19 22:49 EDT 2018. Contains 302749 sequences. (Running on oeis4.)