A338918 Square array of distinct positive integers T(n, k), n > 0, k > 0, read by antidiagonals upwards, filled the greedy way such that for any n > 0 and k > 0, T(n, k) is divisible by n * k.

1, 2, 4, 3, 8, 6, 12, 18, 24, 16, 5, 32, 9, 40, 10, 30, 20, 36, 48, 50, 42, 7, 60, 15, 64, 45, 72, 14, 56, 28, 54, 80, 100, 90, 70, 88, 27, 96, 21, 120, 25, 144, 63, 112, 81, 110, 108, 168, 84, 150, 180, 140, 192, 126, 130, 11, 160, 135, 128, 35, 216, 105, 224, 162, 200, 22

Offset: 1

Author

Rémy Sigrist, Nov 15 2020

Keywords

• nonn
• look
• tabl

Comments

All integers appear in this sequence.

Examples

			Array T(n, k) begins:
  n\k|    1    2    3    4    5    6    7    8    9   10
  ---+--------------------------------------------------
    1|    1    4    6   16   10   42   14   88   81  130
    2|    2    8   24   40   50   72   70  112  126  200
    3|    3   18    9   48   45   90   63  192  162  270
    4|   12   32   36   64  100  144  140  224  288  360
    5|    5   20   15   80   25  180  105  280  315  300
    6|   30   60   54  120  150  216  336  432  486  540
    7|    7   28   21   84   35  294   49  448  441  490
    8|   56   96  168  128  240  384  392  256  576  640
    9|   27  108  135  252  225  378  189  504  243  900
   10|  110  160  210  320  250  420  350  400  810  500
		

Links

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

Crossrefs

See A338872 and A338919 for similar sequences.

Programs

PARI

See Links section.

Formula

T(p, 1) = p for any prime number p.