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.

A350269 Triangle read by rows, T(n, k) = (n - k)!*(n - 1)^k, for 0 <= k <= n.

This page as a plain text file.
%I A350269 #7 Dec 25 2021 14:53:09
%S A350269 1,1,0,2,1,1,6,4,4,8,24,18,18,27,81,120,96,96,128,256,1024,720,600,
%T A350269 600,750,1250,3125,15625,5040,4320,4320,5184,7776,15552,46656,279936,
%U A350269 40320,35280,35280,41160,57624,100842,235298,823543,5764801
%N A350269 Triangle read by rows, T(n, k) = (n - k)!*(n - 1)^k, for 0 <= k <= n.
%e A350269 Triangle starts:
%e A350269 [0]     1
%e A350269 [1]     1,     0
%e A350269 [2]     2,     1,     1
%e A350269 [3]     6,     4,     4,     8
%e A350269 [4]    24,    18,    18,    27,    81
%e A350269 [5]   120,    96,    96,   128,   256,   1024
%e A350269 [6]   720,   600,   600,   750,  1250,   3125,  15625
%e A350269 [7]  5040,  4320,  4320,  5184,  7776,  15552,  46656, 279936
%e A350269 [8] 40320, 35280, 35280, 41160, 57624, 100842, 235298, 823543, 5764801
%p A350269 A350269 := (n, k) -> (n - k)!*(n - 1)^k:
%p A350269 seq(seq(A350269(n, k), k = 0..n), n = 0..9);
%t A350269 T[n_, k_] := If[n - 1 == k == 0, 1, (n - k)! * (n - 1)^k]; Table[T[n, k], {n, 0, 8}, {k, 0, n}] // Flatten (* _Amiram Eldar_, Dec 25 2021 *)
%Y A350269 Cf. A000142 (first column), A001563 (second column), A000312 (subdiagonal), A065440 (main diagonal), A350268 (row sums).
%K A350269 nonn,tabl
%O A350269 0,4
%A A350269 _Peter Luschny_, Dec 25 2021