cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A369381 Triangle of numbers read by rows T(n,k) = binomial(n+1,k+1)*Stirling2(n+k,k).

Original entry on oeis.org

1, 0, 1, 0, 3, 7, 0, 6, 60, 90, 0, 10, 310, 1505, 1701, 0, 15, 1260, 14490, 46620, 42525, 0, 21, 4445, 105875, 716205, 1727110, 1323652, 0, 28, 14280, 653100, 8162000, 38623200
Offset: 0

Views

Author

Keywords

Comments

The triangle T(n,k) is a functional dual of the triangle A269939 in identity: B(n) = Sum_{k=0..n}(-1)^(k)*A269939(n,k)/Binomial(n+k,k) = Sum_{k=0..n}(-1)^(k)*T(n,k)/Binomial(n+k,k). Where B(n) are the Bernoulli numbers.

Examples

			n\k  0      1       2        3        4       5
0:    1
1:    0      1
2:    0      3       7
3:    0      6      60       90
4:    0     10     310     1505     1701
5:    0     15    1260    14490    46620    42525
		

Crossrefs

Cf. A007820 (right diagonal).

Programs

  • Maple
    T:=(n,k)->((n+1)!/((k+1)!*(n-k)!))*Stirling2(n+k,k):seq(seq T(n,k),k=0..n), n=0..10);

Formula

T(n,k) = binomial(n+1,k+1)*Stirling2(n+k,k).