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.

A368982 Triangle read by rows: T(n, k) = binomial(n, k - 1) * (k - 1)^(k - 1) * (n - k) * (n - k + 1)^(n - k) / 2.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 0, 9, 3, 0, 0, 96, 36, 24, 0, 0, 1250, 480, 360, 270, 0, 0, 19440, 7500, 5760, 4860, 3840, 0, 0, 352947, 136080, 105000, 90720, 80640, 65625, 0, 0, 7340032, 2823576, 2177280, 1890000, 1720320, 1575000, 1306368, 0
Offset: 0

Views

Author

Peter Luschny, Jan 11 2024

Keywords

Examples

			Triangle starts:
  [0] [0]
  [1] [0,       0]
  [2] [0,       1,       0]
  [3] [0,       9,       3,       0]
  [4] [0,      96,      36,      24,       0]
  [5] [0,    1250,     480,     360,     270,       0]
  [6] [0,   19440,    7500,    5760,    4860,    3840,       0]
  [7] [0,  352947,  136080,  105000,   90720,   80640,   65625,       0]
  [8] [0, 7340032, 2823576, 2177280, 1890000, 1720320, 1575000, 1306368, 0]
		

Crossrefs

A368849, A369016 and this sequence are alternative sum representation for A001864 with different normalizations.
T(n, k) = A368849(n, k) / 2.
T(n, 1) = A081131(n) for n >= 1.
T(n, n - 1) = A081133(n - 2) for n >= 2.
Sum_{k=0..n} T(n, k) = A036276(n - 1) for n >= 1.
Sum_{k=0..n} (-1)^(k+1)*T(n, k) = A368981(n) / 2 for n >= 0.

Programs

  • Maple
    T := (n, k) -> binomial(n, k-1)*(k-1)^(k-1)*(n-k)*(n-k+1)^(n-k)/2:
    seq(seq(T(n, k), k = 0..n), n=0..9);
  • Mathematica
    A368982[n_, k_] := Binomial[n, k-1] If[k == 1, 1, (k-1)^(k-1)] (n-k) (n-k+1)^(n-k)/2; Table[A368982[n, k], {n, 0, 10}, {k, 0, n}] (* Paolo Xausa, Jan 28 2024 *)
  • SageMath
    def T(n, k): return binomial(n, k-1)*(k-1)^(k-1)*(n-k)*(n-k+1)^(n-k)//2
    for n in range(0, 9): print([T(n, k) for k in range(n + 1)])

Formula