A371246 -id:A371246 - cp's OEIS frontend

A371247 Inverse permutation to A371246.

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

Offset: 1

Rémy Sigrist, Mar 16 2024

nonn

			A371246(42) = 39, so a(39) = 42.

Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, PARI program
Index entries for sequences that are permutations of the natural numbers

Cf. A371246.

PARI
```
See Links section.
```

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.

Original entry on oeis.org

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

Rémy Sigrist, Mar 16 2024

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

			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

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

See A075383, A371246 and A371248 for similar sequences.

Cf. A371237 (inverse).

PARI
```
See Links section.
```

A371248 Square array A(n, k), n, k > 0, read and filled in the greedy way by upward antidiagonals with distinct positive integers such that for any k > 0, the terms in the k-th column are congruent modulo k.

Original entry on oeis.org

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

Offset: 1

Rémy Sigrist, Mar 16 2024

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

			Array A(n, k) begins:
  n\k |  1   2   3   4   5    6    7    8    9   10
  ----+--------------------------------------------
    1 |  1   3   6   8  13   19   22   34   41   46
    2 |  2   5  12  16  23   31   29   42   59   76
    3 |  4   9  15  20  33   37   50   58   68   86
    4 |  7  11  18  28  38   49   57   66   77   96
    5 | 10  17  24  32  43   55   64   74   95  116
    6 | 14  25  30  40  53   61   71   90  104  126
    7 | 21  27  36  52  63   67   92  114  131  136
    8 | 26  39  48  56  73   85  106  122  140  156
    9 | 35  45  54  72  83   91  113  138  149  166
   10 | 44  51  69  80  98  109  127  146  167  196

Rémy Sigrist, Table of n, a(n) for n = 1..10011
Rémy Sigrist, PARI program
Index entries for sequences that are permutations of the natural numbers

See A371236 and A371246 for similar sequences.

Cf. A371249 (inverse).

PARI
```
See Links section.
```

cp's OEIS Frontend

A371247 Inverse permutation to A371246.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A371248 Square array A(n, k), n, k > 0, read and filled in the greedy way by upward antidiagonals with distinct positive integers such that for any k > 0, the terms in the k-th column are congruent modulo k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI