|
|
A096041
|
|
Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^7-M)/6, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.
|
|
1
|
|
|
1, 8, 2, 57, 24, 3, 400, 228, 48, 4, 2801, 2000, 570, 80, 5, 19608, 16806, 6000, 1140, 120, 6, 137257, 137256, 58821, 14000, 1995, 168, 7, 960800, 1098056, 549024, 156856, 28000, 3192, 224, 8, 6725601, 8647200, 4941252, 1647072, 352926, 50400
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1
8 2
57 24 3
400 228 48 4
2801 2000 570 80 5
19608 16806 6000 1140 120 6
|
|
MAPLE
|
P:= proc(n) option remember; local M; M:= Matrix(n, (i, j)-> binomial(i-1, j-1)); (M^7-M)/6 end: T:= (n, k)-> P(n+1)[n+1, k]: seq(seq(T(n, k), k=1..n), n=1..11); # Alois P. Heinz, Oct 07 2009
|
|
MATHEMATICA
|
P[n_] := P[n] = With[{M = Array[Binomial[#1-1, #2-1]&, {n, n}]}, (MatrixPower[M, 7] - M)/6]; T[n_, k_] := P[n+1][[n+1, k]]; Table[ Table[T[n, k], {k, 1, n}], {n, 1, 11}] // Flatten (* Jean-François Alcover, Jan 28 2015, after Alois P. Heinz *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|