|
|
A361927
|
|
Square array A(n, k) of distinct positive integers, n, k > 0, read and filled by upwards antidiagonals in the greedy way such that A(n, k) is a multiple of A(n, 1) and of A(1, k).
|
|
2
|
|
|
1, 2, 3, 4, 6, 5, 7, 12, 10, 8, 9, 21, 20, 16, 11, 13, 18, 35, 24, 22, 14, 15, 39, 45, 56, 44, 28, 17, 19, 30, 65, 72, 77, 84, 34, 23, 25, 57, 60, 104, 99, 42, 68, 46, 26, 27, 75, 95, 120, 143, 126, 119, 92, 52, 29, 31, 54, 50, 152, 165, 182, 153, 161, 156, 58, 32
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence is a variant of A361926.
As a flat sequence, this is a permutation of the positive integers with inverse A361941.
|
|
LINKS
|
|
|
EXAMPLE
|
Array A(n, k) begins:
n\k | 1 2 3 4 5 6 7 8 9 10
----+-----------------------------------------------
1 | 1 3 5 8 11 14 17 23 26 29
2 | 2 6 10 16 22 28 34 46 52 58
3 | 4 12 20 24 44 84 68 92 156 116
4 | 7 21 35 56 77 42 119 161 364 203
5 | 9 18 45 72 99 126 153 207 234 261
6 | 13 39 65 104 143 182 221 299 78 377
7 | 15 30 60 120 165 210 255 345 390 435
8 | 19 57 95 152 209 266 323 437 494 551
9 | 25 75 50 200 275 350 425 575 650 725
10 | 27 54 135 216 297 378 459 621 702 783
|
|
PROG
|
(PARI) See Links section.
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|