A371248 -id:A371248 - cp's OEIS frontend

A371249 Inverse permutation to A371248.

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

Offset: 1

Rémy Sigrist, Mar 16 2024

nonn

			A371248(42) = 49, so a(49) = 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. A371248.

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.
```

A371246 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 n > 0, the terms in the n-th row are congruent modulo n.

Original entry on oeis.org

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

Offset: 1

Rémy Sigrist, Mar 16 2024

Every integer appears in the sequence (as each row 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   5   9  14   17   27   32   42   54
    2 |  2   6   8  12  18   24   30   38   50   68
    3 |  4  10  13  22  25   37   43   49   67   73
    4 |  7  15  19  23  35   39   47   59   75   79
    5 | 11  21  26  31  36   56   66   71   81  106
    6 | 16  28  40  46  52   58   70   82  100  112
    7 | 20  34  41  48  62   76   83   90  118  139
    8 | 29  45  53  61  85   93  101  109  125  149
    9 | 33  51  60  69  96  105  123  141  150  168
   10 | 44  64  74  84  94  114  124  134  144  164

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 A371248 for similar sequences.

Cf. A371247 (inverse).

PARI
```
See Links section.
```

cp's OEIS Frontend

A371249 Inverse permutation to A371248.

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

A371246 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 n > 0, the terms in the n-th row are congruent modulo n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI