A368435 Irregular triangular array T, read by rows: T(n,k) = number of sums |x-y|+|y-z| = 2n-2-k, where x,y,z are in {0,1,...,n}.

1, 2, 4, 2, 2, 4, 10, 8, 3, 2, 4, 8, 16, 18, 12, 4, 2, 4, 8, 12, 24, 28, 26, 16, 5, 2, 4, 8, 12, 18, 32, 40, 40, 34, 20, 6, 2, 4, 8, 12, 18, 24, 42, 52, 56, 52, 42, 24, 7, 2, 4, 8, 12, 18, 24, 32, 52, 66, 72, 72, 64, 50, 28, 8, 2, 4, 8, 12, 18, 24, 32, 40

Offset: 1

Author

Clark Kimberling, Dec 25 2023

Keywords

• nonn
• tabf

Comments

Row n consists of 2n-1 positive integers having sum A000575(n) = n^3.

Examples

			First eight rows:
1
2  4   2
2  4  10   8   3
2  4   8  16  18  12   4
2  4   8  12  24  28  26  16   5
2  4   8  12  18  32  40  40  34  20   6
2  4   8  12  18  24  42  52  56  52  42  24   7
2  4   8  12  18  24  32  52  66  72  72  64  50  28  8
		

Crossrefs

Cf. A000575, A007590 (limiting row), A368434, A368437.

Programs

Mathematica

t[n_] := t[n] = Tuples[Range[n], 3];
a[n_, k_] := Select[t[n], Abs[#[[1]] - #[[2]]] + Abs[#[[2]] - #[[3]]] == 2n-2-k &];
u = Table[Length[a[n, k]], {n, 1, 15}, {k, 0, 2 n - 2}];
Flatten[u]  (* sequence *)
Column[u]   (* array *)