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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A048154 Triangular array T read by rows: T(n,k)=k^3 mod n, for k=1,2,...,n, n=1,2,... 3
 0, 1, 0, 1, 2, 0, 1, 0, 3, 0, 1, 3, 2, 4, 0, 1, 2, 3, 4, 5, 0, 1, 1, 6, 1, 6, 6, 0, 1, 0, 3, 0, 5, 0, 7, 0, 1, 8, 0, 1, 8, 0, 1, 8, 0, 1, 8, 7, 4, 5, 6, 3, 2, 9, 0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10, 0, 1, 8, 3, 4, 5, 0, 7, 8, 9, 4, 11, 0, 1, 8, 1, 12, 8, 8, 5, 5, 1, 12, 5, 12, 0 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS T. D. Noe, Rows n=1..100 of triangle, flattened EXAMPLE Rows: {0}; {1, 0}; {1, 2, 0}; {1, 0, 3, 0}; {1, 3, 2, 4, 0}; {1, 2, 3, 4, 5, 0}; ... MATHEMATICA Table[Mod[k^3, n], {n, 13}, {k, n}] // Flatten (* Michael De Vlieger, Jun 26 2016 *) CROSSREFS Cf. A048155. Sequence in context: A143728 A127368 A112552 * A320602 A134511 A112554 Adjacent sequences: A048151 A048152 A048153 * A048155 A048156 A048157 KEYWORD nonn,tabl AUTHOR Clark Kimberling 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.

Last modified July 12 19:59 EDT 2024. Contains 374252 sequences. (Running on oeis4.)