cp's OEIS Frontend

A328361 Triangle read by rows: T(n,k) is the total number of k's in all partitions of n into consecutive parts, (1 <= k <= n).

%I A328361 #38 Oct 23 2019 08:55:55
%S A328361 1,0,1,1,1,1,0,0,0,1,0,1,1,0,1,1,1,1,0,0,1,0,0,1,1,0,0,1,0,0,0,0,0,0,
%T A328361 0,1,0,1,1,2,1,0,0,0,1,1,1,1,1,0,0,0,0,0,1,0,0,0,0,1,1,0,0,0,0,1,0,0,
%U A328361 1,1,1,0,0,0,0,0,0,1,0,0,0,0,0,1,1,0,0,0,0,0,1,0,1,1,1,1,0,0,0,0,0,0,0,0,1
%N A328361 Triangle read by rows: T(n,k) is the total number of k's in all partitions of n into consecutive parts, (1 <= k <= n).
%C A328361 Iff n is a power of 2 (A000079) then row n lists n - 1 zeros together with 1.
%C A328361 Iff n is an odd prime (A065091) then row n lists (n - 3)/2 zeros, 1, 1, (n - 3)/2 zeros, 1.
%e A328361 Triangle begins:
%e A328361 1;
%e A328361 0, 1;
%e A328361 1, 1, 1;
%e A328361 0, 0, 0, 1;
%e A328361 0, 1, 1, 0, 1;
%e A328361 1, 1, 1, 0, 0, 1;
%e A328361 0, 0, 1, 1, 0, 0, 1;
%e A328361 0, 0, 0, 0, 0, 0, 0, 1;
%e A328361 0, 1, 1, 2, 1, 0, 0, 0, 1;
%e A328361 1, 1, 1, 1, 0, 0, 0, 0, 0, 1;
%e A328361 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1;
%e A328361 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1;
%e A328361 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1;
%e A328361 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1;
%e A328361 1, 1, 1, 2, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1;
%e A328361 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
%e A328361 ...
%e A328361 For n = 9 there are three partitions of 9 into consecutive parts, they are [9], [5, 4], [4, 3, 2], so the 9th row of triangle is [0, 1, 1, 2, 1, 0, 0, 0, 1].
%Y A328361 Row sums give A204217.
%Y A328361 Column 1 gives A010054, n >= 1.
%Y A328361 Leading diagonal gives A000012.
%Y A328361 Cf. A000079, A001227, A065091, A066633, A237048, A237593, A245579, A266531, A285898, A285899, A285900, A285914, A286000, A286001, A299765, A328362.
%K A328361 nonn,tabl
%O A328361 1,40
%A A328361 _Omar E. Pol_, Oct 20 2019