A371236 Triangle T(n, k), n > 0, k = 1..n, read and filled in the greedy way by rows with distinct positive integers such that for any n > 0, the terms in the n-th row are congruent modulo n.

1, 2, 4, 3, 6, 9, 5, 13, 17, 21, 7, 12, 22, 27, 32, 8, 14, 20, 26, 38, 44, 10, 24, 31, 45, 52, 59, 66, 11, 19, 35, 43, 51, 67, 75, 83, 15, 33, 42, 60, 69, 78, 87, 96, 105, 16, 36, 46, 56, 76, 86, 106, 116, 126, 136, 18, 29, 40, 62, 73, 84, 95, 117, 128, 139, 150

Offset

1,2

Comments

Every integer appears in the sequence (as each row starts with the least missing value).

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10011 (rows for n = 1..141 flattened)

Rémy Sigrist, PARI program

Index entries for sequences that are permutations of the natural numbers

Example

Triangle T(n, k) begins:
                     1
                   2   4
                 3   6   9
               5  13  17  21
             7  12  22  27  32
           8  14  20  26  38  44
        10  24  31  45  52  59  66
      11  19  35  43  51  67  75  83

Prog

(PARI) See Links section.

Crossrefs

See A075383, A371246 and A371248 for similar sequences.

Cf. A371237 (inverse).

Sequence in context: A361748 A377093 A372337 * A246366 A271865 A075652

Adjacent sequences: A371233 A371234 A371235 * A371237 A371238 A371239

Keyword

nonn,tabl

Author

Rémy Sigrist, Mar 16 2024

Status

approved