The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225054 Triangle read by rows: Eulerian numbers T(n,k) = A008292(n,k) reduced mod n+1. 0
 0, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 5, 3, 3, 5, 7, 1, 1, 7, 1, 7, 4, 7, 1, 7, 1, 1, 3, 0, 2, 4, 4, 2, 0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 11, 9, 6, 6, 6 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 COMMENTS The row sums are: {0, 2, 3, 8, 5, 12, 7, 32, 36, 20, 11, 72, 13,...} LINKS Eric Weisstein's World of Mathematics, Eulerian Number FORMULA t(n,m)=Mod(Eulerian(n+1,m),n+1) EXAMPLE Triangle begins: {0}, {1,1}, {1,1,1}, {1,3,3,1}, {1,1,1,1,1}, {1,3,2,2,3,1}, {1,1,1,1,1,1,1}, {1,7,5,3,3,5,7,1}, {1,7,1,7,4,7,1,7,1}, {1,3,0,2,4,4,2,0,3,1}, {1,1,1,1,1,1,1,1,1,1,1}, {1,3,11,9,6,6,6,6,9,11,3,1}, {1,1,1,1,1,1,1,1,1,1,1,1,1}}, ... MATHEMATICA Flatten[Table[Table[Mod[Eulerian[n+1, m], n+1], {m, 0, n}], {n, 0, 12}]] CROSSREFS Cf. A008292, A225043. Sequence in context: A283797 A059441 A186028 * A059790 A307156 A326057 Adjacent sequences:  A225051 A225052 A225053 * A225055 A225056 A225057 KEYWORD nonn,tabl AUTHOR Roger L. Bagula, Apr 26 2013 STATUS approved

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

Last modified August 8 11:30 EDT 2020. Contains 336295 sequences. (Running on oeis4.)