login

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”).

Triangular array T read by rows: T(n,k)=k mod n, for k=1,2,...,n, n=1,2,...
1

%I #18 Feb 22 2024 07:54:39

%S 0,1,0,1,2,0,1,2,3,0,1,2,3,4,0,1,2,3,4,5,0,1,2,3,4,5,6,0,1,2,3,4,5,6,

%T 7,0,1,2,3,4,5,6,7,8,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,10,0,1,2,

%U 3,4,5,6,7,8,9,10,11,0,1,2,3,4,5,6,7,8,9,10,11,12,0

%N Triangular array T read by rows: T(n,k)=k mod n, for k=1,2,...,n, n=1,2,...

%F G.f.: x^2*y/((1 - x)*(1 - x*y)^2). - _Stefano Spezia_, Feb 21 2024

%e Triangle begins:

%e 0;

%e 1, 0;

%e 1, 2, 0;

%e 1, 2, 3, 0;

%e 1, 2, 3, 4, 0;

%e ...

%t Flatten[Table[Mod[k,n],{n,15},{k,n}]] (* _Harvey P. Dale_, Mar 21 2012 *)

%Y As a sequence, essentially same as A002262.

%K nonn,tabl

%O 1,5

%A _Clark Kimberling_