152637

Appears in sequences

• Eulerian numbers (Euler's triangle: column k=3 of A008292, column k=2 of A173018).at n=8A000460
• Numbers in the triangle of Eulerian numbers (A008292) that are not 1.at n=37A014449
• Odd numbers in the triangle of Eulerian numbers.at n=34A014459
• Odd numbers in the triangle of Eulerian numbers.at n=35A014459
• Odd numbers in the triangle of Eulerian numbers that are not 1.at n=14A014461
• Odd numbers in the triangle of Eulerian numbers that are not 1.at n=15A014461
• Triangular array formed from elements to right of middle of rows of the triangle of Eulerian numbers.at n=27A014467
• Triangular array formed from elements to right of middle of rows of the triangle of Eulerian numbers that are greater than 1.at n=18A014468
• Triangular array formed from odd elements to right of middle of rows of the triangle of Eulerian numbers (A008292).at n=16A014469
• Triangular array formed from odd elements to right of middle of rows of the triangle of Eulerian numbers that are greater than 1.at n=7A014470
• Distinct elements occurring in triangle of Eulerian numbers (unsorted).at n=22A014630
• Distinct elements occurring in triangle of Eulerian numbers (sorted).at n=25A030196
• Sub-triangle of A008292: take every second term of every second row.at n=16A085503
• Sub-triangle of A008292: take every second term of every second row.at n=19A085503
• Triangle read by rows: imaginary part of polylog expansion of Eulerian numbers: p(x,n) = (1 - I*x)^(n + 1)*PolyLog(-n, I*x)/x.at n=64A143197
• Triangle T(n, k) = Eulerian(n*f(n, k) + 1, f(n, k)), where f(n, k) = k if k <= floor(n/2) otherwise n-k, read by rows.at n=17A157221
• Triangle T(n, k) = Eulerian(n*f(n, k) + 1, f(n, k)), where f(n, k) = k if k <= floor(n/2) otherwise n-k, read by rows.at n=18A157221
• T(n, k) = Eulerian1(n - k, k), for n >= 0 and 0 <= k <= floor(n/2). Triangle read by rows.at n=51A344393