A306915
Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of g.f. 1/((1-x)^k-x^k).
Original entry on oeis.org
1, 1, 2, 1, 2, 4, 1, 3, 4, 8, 1, 4, 6, 8, 16, 1, 5, 10, 11, 16, 32, 1, 6, 15, 20, 21, 32, 64, 1, 7, 21, 35, 36, 42, 64, 128, 1, 8, 28, 56, 70, 64, 85, 128, 256, 1, 9, 36, 84, 126, 127, 120, 171, 256, 512, 1, 10, 45, 120, 210, 252, 220, 240, 342, 512, 1024
Offset: 0
Square array begins:
1, 1, 1, 1, 1, 1, 1, 1, ...
2, 2, 3, 4, 5, 6, 7, 8, ...
4, 4, 6, 10, 15, 21, 28, 36, ...
8, 8, 11, 20, 35, 56, 84, 120, ...
16, 16, 21, 36, 70, 126, 210, 330, ...
32, 32, 42, 64, 127, 252, 462, 792, ...
64, 64, 85, 120, 220, 463, 924, 1716, ...
128, 128, 171, 240, 385, 804, 1717, 3432, ...
256, 256, 342, 496, 715, 1365, 3017, 6436, ...
-
A[n_, k_] := Sum[Binomial[n + k - 1, k*j + k - 1], {j, 0, Floor[n/k]}]; Table[A[n - k, k], {n, 0, 11}, {k, n, 1, -1}] // Flatten (* Amiram Eldar, May 25 2021 *)
A307394
Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of g.f. ((1-x)^(k-4))/((1-x)^k+x^k).
Original entry on oeis.org
1, 1, 3, 1, 4, 6, 1, 4, 9, 10, 1, 4, 10, 14, 15, 1, 4, 10, 19, 15, 21, 1, 4, 10, 20, 28, 8, 28, 1, 4, 10, 20, 34, 28, -7, 36, 1, 4, 10, 20, 35, 48, 1, -22, 45, 1, 4, 10, 20, 35, 55, 48, -80, -21, 55, 1, 4, 10, 20, 35, 56, 75, 0, -242, 12, 66, 1, 4, 10, 20, 35, 56, 83, 75, -164, -485, 77, 78
Offset: 0
Square array begins:
1, 1, 1, 1, 1, 1, 1, 1, 1, ...
3, 4, 4, 4, 4, 4, 4, 4, 4, ...
6, 9, 10, 10, 10, 10, 10, 10, 10, ...
10, 14, 19, 20, 20, 20, 20, 20, 20, ...
15, 15, 28, 34, 35, 35, 35, 35, 35, ...
21, 8, 28, 48, 55, 56, 56, 56, 56, ...
28, -7, 1, 48, 75, 83, 84, 84, 84, ...
36, -22, -80, 0, 75, 110, 119, 120, 120, ...
45, -21, -242, -164, 0, 110, 154, 164, 165, ...
-
T[n_, k_] := Sum[(-1)^j * Binomial[n+3, k*j + 3], {j, 0, Floor[n/k]}]; Table[T[n - k, k], {n, 0, 12}, {k, n, 1, -1}] // Flatten (* Amiram Eldar, May 20 2021 *)
A307665
A(n,k) = Sum_{j=0..floor(n/k)} binomial(2*n,k*j+n), square array A(n,k) read by antidiagonals, for n >= 0, k >= 1.
Original entry on oeis.org
1, 1, 3, 1, 2, 11, 1, 2, 7, 42, 1, 2, 6, 26, 163, 1, 2, 6, 21, 99, 638, 1, 2, 6, 20, 78, 382, 2510, 1, 2, 6, 20, 71, 297, 1486, 9908, 1, 2, 6, 20, 70, 262, 1145, 5812, 39203, 1, 2, 6, 20, 70, 253, 990, 4447, 22819, 155382, 1, 2, 6, 20, 70, 252, 936, 3796, 17358, 89846, 616666
Offset: 0
Square array begins:
1, 1, 1, 1, 1, 1, 1, 1, ...
3, 2, 2, 2, 2, 2, 2, 2, ...
11, 7, 6, 6, 6, 6, 6, 6, ...
42, 26, 21, 20, 20, 20, 20, 20, ...
163, 99, 78, 71, 70, 70, 70, 70, ...
638, 382, 297, 262, 253, 252, 252, 252, ...
2510, 1486, 1145, 990, 936, 925, 924, 924, ...
9908, 5812, 4447, 3796, 3523, 3446, 3433, 3432, ...
-
T[n_, k_] := Sum[Binomial[2*n, k*j + n], {j, 0, Floor[n/k]}]; Table[T[n - k, k], {n, 0, 11}, {k, n, 1, -1}] // Flatten (* Amiram Eldar, May 13 2021*)
Showing 1-3 of 3 results.