|
|
A338919
|
|
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 and by k.
|
|
4
|
|
|
1, 2, 4, 3, 6, 9, 8, 12, 18, 16, 5, 20, 15, 24, 10, 30, 40, 36, 48, 50, 42, 7, 54, 45, 28, 60, 66, 14, 32, 56, 72, 80, 100, 78, 70, 64, 27, 88, 21, 84, 25, 96, 63, 104, 81, 90, 108, 120, 112, 150, 180, 140, 144, 126, 110, 11, 130, 99, 128, 35, 102, 105, 136, 117, 160, 22
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
All integers appear in this sequence.
|
|
LINKS
|
|
|
FORMULA
|
T(p, 1) = p for any prime number p.
|
|
EXAMPLE
|
Array T(n, k) begins:
n\k| 1 2 3 4 5 6 7 8 9 10
---+-------------------------------------------------
1| 1 4 9 16 10 42 14 64 81 110
2| 2 6 18 24 50 66 70 104 126 160
3| 3 12 15 48 60 78 63 144 117 270
4| 8 20 36 28 100 96 140 136 288 260
5| 5 40 45 80 25 180 105 240 225 190
6| 30 54 72 84 150 102 252 312 198 360
7| 7 56 21 112 35 168 49 280 315 490
8| 32 88 120 128 200 264 224 152 504 400
9| 27 108 99 216 135 162 189 432 153 720
10| 90 130 210 220 170 330 350 320 630 230
|
|
PROG
|
(PARI) See Links section.
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|