Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Sep 15 2023 05:26:00
%S 1,3,1,6,1,1,10,1,3,1,15,1,3,1,1,21,1,3,4,3,1,28,1,3,4,3,1,1,36,1,3,4,
%T 7,1,3,1,45,1,3,4,7,1,6,1,1,55,1,3,4,7,6,6,1,3,1,66,1,3,4,7,6,6,1,3,1,
%U 1,78,1,3,4,7,6,12,1,7,4,3,1,91,1,3,4,7,6,12,1,7,4,3,1,1,105,1,3,4,7,6,12,8,7,4,3,1,3,1
%N Triangle T(n,m) = A000012*A127094 read by rows.
%C Consider A000012 as a lower-left all-1's triangle, and build the matrix product by multiplication with A127094 from the right.
%F T(n,m) = Sum_{j=m..n} A000012(n,j)*A127094(j,m) = Sum_{j=m..n} A127094(j,m).
%e First few rows of the triangle are:
%e 1;
%e 3, 1,
%e 6, 1, 1;
%e 10, 1, 3, 1;
%e 15, 1, 3, 1, 1;
%e 21, 1, 3, 4, 3, 1;
%e 28, 1, 3, 4, 3, 1, 1;
%e ...
%p A127093 := proc(n,m) if n mod m = 0 then m; else 0 ; fi; end:
%p A127094 := proc(n,m) A127093(n, n-m+1) ; end:
%p A127096 := proc(n,m) add( A127094(j,m),j=m..n) ; end:
%p for n from 1 to 15 do for m from 1 to n do printf("%d,",A127096(n,m)) ; od: od: # _R. J. Mathar_, Aug 18 2009
%t T[n_, m_] := Sum[1 + Mod[j, m - j - 1] - Mod[1 + j, m - j - 1], {j, m, n}];
%t Table[T[n, m], {n, 1, 14}, {m, 1, n}] // Flatten (* _Jean-François Alcover_, Sep 15 2023 *)
%Y Cf. A127093, A127094, A123229, A024916 (row sums), A000203, A126988.
%K nonn,easy,tabl
%O 1,2
%A _Gary W. Adamson_, Jan 05 2007
%E Edited and extended by _R. J. Mathar_, Aug 18 2009