login
A371248
Square array A(n, k), n, k > 0, read and filled in the greedy way by upward antidiagonals with distinct positive integers such that for any k > 0, the terms in the k-th column are congruent modulo k.
4
1, 2, 3, 4, 5, 6, 7, 9, 12, 8, 10, 11, 15, 16, 13, 14, 17, 18, 20, 23, 19, 21, 25, 24, 28, 33, 31, 22, 26, 27, 30, 32, 38, 37, 29, 34, 35, 39, 36, 40, 43, 49, 50, 42, 41, 44, 45, 48, 52, 53, 55, 57, 58, 59, 46, 47, 51, 54, 56, 63, 61, 64, 66, 68, 76, 60
OFFSET
1,2
COMMENTS
Every integer appears in the sequence (as each column starts with the least missing value).
EXAMPLE
Array A(n, k) begins:
n\k | 1 2 3 4 5 6 7 8 9 10
----+--------------------------------------------
1 | 1 3 6 8 13 19 22 34 41 46
2 | 2 5 12 16 23 31 29 42 59 76
3 | 4 9 15 20 33 37 50 58 68 86
4 | 7 11 18 28 38 49 57 66 77 96
5 | 10 17 24 32 43 55 64 74 95 116
6 | 14 25 30 40 53 61 71 90 104 126
7 | 21 27 36 52 63 67 92 114 131 136
8 | 26 39 48 56 73 85 106 122 140 156
9 | 35 45 54 72 83 91 113 138 149 166
10 | 44 51 69 80 98 109 127 146 167 196
PROG
(PARI) See Links section.
CROSSREFS
See A371236 and A371246 for similar sequences.
Cf. A371249 (inverse).
Sequence in context: A072966 A363246 A245761 * A059759 A042952 A126327
KEYWORD
nonn,tabl
AUTHOR
Rémy Sigrist, Mar 16 2024
STATUS
approved