A363623 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with reverse-weighted alternating sum k (leading and trailing 0's omitted).
1, 1, 1, 1, 1, 2, 2, 0, 1, 2, 2, 1, 1, 1, 1, 1, 3, 1, 0, 3, 0, 1, 1, 1, 1, 3, 2, 0, 3, 1, 2, 0, 1, 0, 1, 2, 5, 1, 0, 3, 1, 2, 2, 2, 1, 1, 0, 1, 0, 1, 2, 5, 3, 0, 4, 2, 2, 0, 3, 2, 1, 3, 0, 0, 1, 0, 1, 1, 1, 1, 7, 2, 0, 4, 1, 5, 2, 3, 1, 3, 0, 2, 3, 1, 2, 1, 0, 0, 1, 0, 1, 1, 1, 1
Offset: 0
Examples
Triangle begins: 1 1 1 1 1 2 2 0 1 2 2 1 1 1 1 1 3 1 0 3 0 1 1 1 1 3 2 0 3 1 2 0 1 0 1 2 5 1 0 3 1 2 2 2 1 1 0 1 0 1 2 5 3 0 4 2 2 0 3 2 1 3 0 0 1 0 1 1 1 1 Row n = 6 counts the following partitions: k=3 k=4 k=6 k=8 k=9 k=10 k=11 -------------------------------------------------------------- (33) (222) . (6) . (21111) (51) (3111) (411) (2211) (42) (111111) (321)
Crossrefs
Programs
-
Mathematica
revaltwtsum[y_]:=Sum[(-1)^(Length[y]-k)*k*y[[-k]],{k,1,Length[y]}]; Table[Length[Select[IntegerPartitions[n],revaltwtsum[#]==k&]],{n,0,15},{k,Floor[(n+1)/2],Ceiling[n*(n+1)/4]}]
Comments