A370981 Triangle T(n, k), n >= 0, k = 0..n, read and filled in the greedy way by rows with distinct nonnegative integers, such that for any n > 0 and any k in 0..n, T(n, k) is congruent modulo n to T(n-1, k-1) (provided that k > 0) or to T(n-1, k) (provided that k < n).

0, 1, 2, 3, 4, 6, 9, 7, 10, 12, 5, 11, 14, 8, 16, 15, 20, 19, 13, 18, 21, 27, 26, 25, 31, 24, 30, 33, 34, 40, 32, 17, 38, 23, 37, 47, 42, 48, 56, 41, 22, 39, 29, 45, 55, 51, 57, 65, 50, 49, 58, 66, 36, 28, 46, 61, 67, 35, 60, 59, 68, 76, 86, 78, 88, 96

Offset: 0

Author

Rémy Sigrist, Mar 06 2024

Keywords

• nonn
• tabl

Comments

This sequence can be seen as a two-dimensional variant of A125717.

Will every integer appear in the sequence?

Examples

			Triangle T(n, k) begins:
                         0
                       1   2
                     3   4   6
                   9   7  10  12
                 5  11  14   8  16
              15  20  19  13  18  21
            27  26  25  31  24  30  33
          34  40  32  17  38  23  37  47
        42  48  56  41  22  39  29  45  55
      51  57  65  50  49  58  66  36  28  46
    61  67  35  60  59  68  76  86  78  88  96
  72  83  79  71  70  81  43  53  64  44  52  63
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 0..10010 (rows for n = 0..140 flattened)
• Rémy Sigrist, Colored representation of the first 500 rows
• Rémy Sigrist, PARI program

Crossrefs

Cf. A125717.

Programs

PARI

See Links section.