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.

A360646 Square array A(n, k), n, k > 0, read by antidiagonals upwards; A(n, k) = A066208(n) * A066207(k).

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 5, 12, 14, 9, 8, 15, 28, 18, 13, 10, 24, 35, 36, 26, 19, 11, 30, 56, 45, 52, 38, 21, 16, 33, 70, 72, 65, 76, 42, 27, 17, 48, 77, 90, 104, 95, 84, 54, 29, 20, 51, 112, 99, 130, 152, 105, 108, 58, 37, 22, 60, 119, 144, 143, 190, 168, 135, 116, 74, 39
Offset: 1

Views

Author

Rémy Sigrist, Feb 15 2023

Keywords

Comments

Every positive integer occurs exactly once.

Examples

			Array A(n, k) begins:
  n\k |  1   2    3    4    5    6    7    8    9   10
  ----+-----------------------------------------------
    1 |  1   3    7    9   13   19   21   27   29   37
    2 |  2   6   14   18   26   38   42   54   58   74
    3 |  4  12   28   36   52   76   84  108  116  148
    4 |  5  15   35   45   65   95  105  135  145  185
    5 |  8  24   56   72  104  152  168  216  232  296
    6 | 10  30   70   90  130  190  210  270  290  370
    7 | 11  33   77   99  143  209  231  297  319  407
    8 | 16  48  112  144  208  304  336  432  464  592
    9 | 17  51  119  153  221  323  357  459  493  629
   10 | 20  60  140  180  260  380  420  540  580  740
		

Crossrefs

Programs

  • PARI
    See Links section.

Formula

A(n, 1) = A066208(n) = A247503(A(n,k)).
A(1, k) = A066207(k) = A248101(A(n,k)).