login
A326934
Table of A(n,k) read by antidiagonals, where A(n,k) = (n*k) mod (n+1).
1
1, 0, 2, 1, 1, 3, 0, 0, 2, 4, 1, 2, 1, 3, 5, 0, 1, 0, 2, 4, 6, 1, 0, 3, 1, 3, 5, 7, 0, 2, 2, 0, 2, 4, 6, 8, 1, 1, 1, 4, 1, 3, 5, 7, 9, 0, 0, 0, 3, 0, 2, 4, 6, 8, 10, 1, 2, 3, 2, 5, 1, 3, 5, 7, 9, 11, 0, 1, 2, 1, 4, 0, 2, 4, 6, 8, 10, 12, 1, 0, 1, 0, 3, 6, 1, 3
OFFSET
1,3
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..1275 (first 50 antidiagonals)
FORMULA
A(n,k) = (n*k) mod (n+1).
EXAMPLE
Table begins:
1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...
2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, ...
3, 2, 1, 0, 3, 2, 1, 0, 3, 2, 1, 0, 3, 2, 1, 0, ...
4, 3, 2, 1, 0, 4, 3, 2, 1, 0, 4, 3, 2, 1, 0, 4, ...
5, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 5, 4, 3, 2, ...
6, 5, 4, 3, 2, 1, 0, 6, 5, 4, 3, 2, 1, 0, 6, 5, ...
7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, ...
8, 7, 6, 5, 4, 3, 2, 1, 0, 8, 7, 6, 5, 4, 3, 2, ...
PROG
(PARI) T(n, k)={(n*k) % (n+1)} \\ Andrew Howroyd, Oct 22 2019
CROSSREFS
Cf. A004736.
Sequence in context: A320076 A138948 A186114 * A290691 A366900 A155726
KEYWORD
nonn,tabl
AUTHOR
Ali Sada, Oct 22 2019
STATUS
approved