Original entry on oeis.org
1, 2, 4, 8, 16, 20, 32, 34, 46, 52, 58, 62, 64, 74, 94, 106, 122, 128, 134, 136, 146, 158, 166, 178, 184, 194, 206, 214, 218, 226, 232, 254, 256, 262, 278, 298, 302, 314, 326, 334, 346, 358, 362, 376, 382, 386, 394, 398, 422, 424, 446, 454, 458, 464, 466, 478
Offset: 1
Original entry on oeis.org
1, 3, 6, 9, 15, 21, 27, 33, 39, 57, 63, 81, 93, 99, 111, 123, 129, 147, 171, 177, 189, 213, 231, 243, 267, 279, 291, 297, 303, 333, 339, 363, 369, 387, 393, 399, 405, 411, 441, 501, 513, 531, 537, 567, 573, 579, 591, 597, 627, 639, 651, 675, 681, 693, 699, 717
Offset: 1
A082005
Sum of n-th antidiagonal of array in A082002.
Original entry on oeis.org
1, 5, 22, 45, 99, 181, 260, 441, 535, 824, 1063, 1437, 1962, 2325, 3114, 3545, 4052, 5063, 6554, 7247, 8734, 9706, 11270, 12875, 16101, 16930, 20137, 20958, 24068, 27492, 29591, 32862, 35482, 42080, 44659, 48992, 51983, 55769, 58300, 65916
Offset: 1
A082017
First row of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.
Original entry on oeis.org
1, 2, 7, 6, 18, 15, 28, 29, 49, 45, 75, 66, 94, 91, 130, 120, 155, 153, 201, 190, 232, 231, 288, 276, 325, 326, 391, 378, 462, 435, 508, 496, 589, 561, 641, 630, 732, 703, 790, 780, 891, 861, 955, 946, 1066, 1035, 1136, 1128, 1257, 1225, 1333, 1326, 1464, 1431
Offset: 1
T(n,k) begins:
1, 2, 7, 6, 18, 15, ...
4, 5, 8, 14, 16, 27, ...
3, 9, 12, 17, 26, 31, ...
13, 11, 19, 25, 32, 42, ...
10, 20, 24, 33, 41, 50, ...
21, 23, 34, 39, 51, 60, ...
A082018
First column of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.
Original entry on oeis.org
1, 4, 3, 13, 10, 21, 22, 40, 36, 64, 55, 81, 78, 115, 105, 138, 136, 182, 171, 211, 210, 265, 253, 300, 301, 364, 351, 433, 406, 477, 465, 556, 528, 606, 595, 695, 666, 751, 741, 850, 820, 912, 903, 1021, 990, 1089, 1081, 1208, 1176, 1282, 1275, 1411, 1378
Offset: 1
T(n,k) begins:
1, 2, 7, 6, 18, 15, ...
4, 5, 8, 14, 16, 27, ...
3, 9, 12, 17, 26, 31, ...
13, 11, 19, 25, 32, 42, ...
10, 20, 24, 33, 41, 50, ...
21, 23, 34, 39, 51, 60, ...
A082019
Diagonal of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.
Original entry on oeis.org
1, 5, 12, 25, 41, 60, 85, 112, 145, 180, 221, 264, 313, 365, 420, 481, 544, 613, 684, 761, 840, 925, 1012, 1105, 1200, 1301, 1404, 1513, 1624, 1741, 1860, 1985, 2112, 2245, 2380, 2521, 2664, 2813, 2964, 3121, 3281, 3444, 3613, 3784, 3961, 4140, 4325, 4512
Offset: 1
T(n,k) begins:
1, 2, 7, 6, 18, 15, ...
4, 5, 8, 14, 16, 27, ...
3, 9, 12, 17, 26, 31, ...
13, 11, 19, 25, 32, 42, ...
10, 20, 24, 33, 41, 50, ...
21, 23, 34, 39, 51, 60, ...
A082006
In the following square array numbers (not occurring earlier) are entered like this: a(1, 1), a(1, 2), a(2, 1), a(3, 1), a(2, 2), a(1, 3), a(1, 4), a(2, 3), a(3, 2), a(4, 1), a(5, 1), a(4, 2), ... such that every entry is coprime to the members of the row and column it belongs, with the condition that the n-th diagonal sum is a multiple of n. 1 2 7 9 31 25... 4 5 11 23 27... 3 13 8... 19 21... 17 ... ... Sequence contains numbers as they are entered.
Original entry on oeis.org
1, 2, 4, 3, 5, 7, 9, 11, 13, 19, 17, 21, 8, 23, 31, 25, 27, 29, 37, 41
Offset: 1
Table is
1 2 7 9 31 25
4 5 11 23 27
3 13 8 29
19 21 37
17 41
?
Showing 1-7 of 7 results.
Comments