cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A371237 Inverse permutation to A371236.

Original entry on oeis.org

1, 2, 4, 3, 7, 5, 11, 16, 6, 22, 29, 12, 8, 17, 37, 46, 9, 56, 30, 18, 10, 13, 67, 23, 79, 19, 14, 92, 57, 106, 24, 15, 38, 121, 31, 47, 137, 20, 154, 58, 172, 39, 32, 21, 25, 48, 68, 191, 211, 122, 33, 26, 232, 138, 254, 49, 155, 277, 27, 40, 301, 59, 326, 80
Offset: 1

Views

Author

Rémy Sigrist, Mar 16 2024

Keywords

Examples

			A371236(42) = 78, so a(78) = 42.

Links

Crossrefs

Cf. A000217, A371236.

Programs

  • PARI
    See Links section.

Formula

a(n) - 1 <= A000217(n - 1).

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

Views

Author

Rémy Sigrist, Mar 16 2024

Keywords

Comments

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

Examples

			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

Links

Crossrefs

See A371236 and A371248 for similar sequences.
Cf. A371247 (inverse).

Programs

  • 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

Views

Author

Rémy Sigrist, Mar 16 2024

Keywords

Comments

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

Examples

			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

Links

Crossrefs

See A371236 and A371246 for similar sequences.
Cf. A371249 (inverse).

Programs

  • PARI
    See Links section.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.