login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048151 Triangular array T read by rows: T(n,k)=k mod n, for k=1,2,...,n, n=1,2,... 1
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, 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, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
G.f.: x^2*y/((1 - x)*(1 - x*y)^2). - Stefano Spezia, Feb 21 2024
EXAMPLE
Triangle begins:
0;
1, 0;
1, 2, 0;
1, 2, 3, 0;
1, 2, 3, 4, 0;
...
MATHEMATICA
Flatten[Table[Mod[k, n], {n, 15}, {k, n}]] (* Harvey P. Dale, Mar 21 2012 *)
CROSSREFS
As a sequence, essentially same as A002262.
Sequence in context: A166352 A025690 A025668 * A025675 A025682 A025691
KEYWORD
nonn,tabl
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 10:38 EDT 2024. Contains 372163 sequences. (Running on oeis4.)