A340423 Irregular triangle read by rows T(n,k) in which row n has length A000041(n-1) and every column k is A024916, n >= 1, k >= 1.
1, 4, 8, 1, 15, 4, 1, 21, 8, 4, 1, 1, 33, 15, 8, 4, 4, 1, 1, 41, 21, 15, 8, 8, 4, 4, 1, 1, 1, 1, 56, 33, 21, 15, 15, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 69, 41, 33, 21, 21, 15, 15, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 87, 56, 41, 33, 33, 21, 21, 15, 15, 15, 15, 8, 8, 8, 8
Offset: 1
Examples
Triangle begins: 1; 4; 8, 1; 15, 4, 1; 21, 8, 4, 1, 1; 33, 15, 8, 4, 4, 1, 1; 41, 21, 15, 8, 8, 4, 4, 1, 1, 1, 1; 56, 33, 21, 15, 15, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1; 69, 41, 33, 21, 21, 15, 15, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1; ... For n = 9 the length of row 9 is A000041(9-1) = 22. From _Omar E. Pol_, Jan 08 2022: (Start) For n = 9 the lateral view and top view of the tower described in A221529 look like as shown below: _ 22 1 | | 21 1 | | 20 1 | | 19 1 | | 18 1 | | 17 1 | | 16 1 |_|_ 15 4 | | 14 4 | | 13 4 | | 12 4 |_ _|_ 11 8 | | | 10 8 | | | 9 8 | | | 8 8 |_ _|_|_ 7 15 | | | 6 15 |_ _ _| |_ 5 21 | | | 4 21 |_ _ _|_ _|_ 3 33 |_ _ _ _| | |_ 2 41 |_ _ _ _|_|_ _|_ _ 1 69 |_ _ _ _ _|_ _|_ _| . Level Row 9 Lateral view k T(9,k) of the tower . _ _ _ _ _ _ _ _ _ |_| | | | | | | | |_ _|_| | | | | | |_ _| _|_| | | | |_ _ _| _|_| | |_ _ _| _| _ _| |_ _ _ _| | |_ _ _ _| _ _| | | |_ _ _ _ _| . Top view of the tower . For n = 9 and k = 1 there are 69 cubic cells in the level 1 starting from the base of the tower, so T(9,1) = 69. For n = 9 and k = 22 there is only one cubic cell in the level 22 (the top) of the tower, so T(9,22) = 1. The volume of the tower (also the total number of cubic cells) represents the 9th term of the convolution of A000203 and A000041 hence it's equal to A066186(9) = 270, equaling the sum of the 9th row of triangle. (End)
Crossrefs
Programs
-
PARI
f(n) = numbpart(n-1); T(n, k) = {if (k > f(n), error("invalid k")); if (k==1, return (n)); my(s=0); while (k <= f(n-1), s++; n--; ); 1+s; } \\ A336811 g(n) = sum(k=1, n, n\k*k); \\ A024916 row(n) = vector(f(n), k, g(T(n,k))); \\ Michel Marcus, Jan 22 2022
Formula
T(n,k) = Sum_{j=1..n} A339278(j,k). - Omar E. Pol, Jan 08 2022
Comments