OFFSET
1,2
LINKS
Alois P. Heinz, Rows n = 1..200, flattened
FORMULA
EXAMPLE
Triangle begins:
1;
2, 4;
4, 4, 9;
7, 12, 9, 16;
12, 16, 18, 16, 25,
19, 32, 36, 32, 25, 36;
30, 44, 54, 48, 50, 36, 49;
...
For n = 4 the partitions of 4 are [4], [2, 2], [3, 1], [2, 1, 1], [1, 1, 1, 1], so the squares of the parts are respectively [16], [4, 4], [9, 1], [4, 1, 1], [1, 1, 1, 1]. The sum of the squares of the parts 1 is 1 + 1 + 1 + 1 + 1 + 1 + 1 = 7. The sum of the squares of the parts 2 is 4 + 4 + 4 = 12. The sum of the squares of the parts 3 is 9. The sum of the squares of the parts 4 is 16. So the fourth row of triangle is [7, 12, 9, 16].
MAPLE
b:= proc(n, i) option remember; `if`(n=0 or i=1, 1+n*x, b(n, i-1)+
(p-> p+(coeff(p, x, 0)*i^2)*x^i)(b(n-i, min(n-i, i))))
end:
T:= n-> (p-> seq(coeff(p, x, i), i=1..n))(b(n$2)):
seq(T(n), n=1..14); # Alois P. Heinz, Mar 20 2018
MATHEMATICA
b[n_, i_] := b[n, i] = If[n == 0 || i == 1, 1 + n*x, b[n, i - 1] + # + (Coefficient[#, x, 0]*i^2*x^i)&[b[n - i, Min[n - i, i]]]];
T[n_] := Table[Coefficient[#, x, i], {i, 1, n}]&[b[n, n]];
Table[T[n], {n, 1, 14}] // Flatten (* Jean-François Alcover, May 22 2018, after Alois P. Heinz *)
PROG
(PARI) row(n) = {v = vector(n); forpart(p=n, for(k=1, #p, v[p[k]] += p[k]^2; ); ); v; } \\ Michel Marcus, Mar 20 2018
KEYWORD
nonn,tabl
AUTHOR
Omar E. Pol, Mar 19 2018
EXTENSIONS
More terms from Michel Marcus, Mar 20 2018
STATUS
approved