This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A366303 #7 Oct 08 2023 09:00:42 %S A366303 1,2,3,5,7,4,9,8,11,13,17,19,21,15,23,29,25,31,37,41,35,43,47,53,14, %T A366303 59,61,67,49,71,65,73,55,79,83,89,97,101,103,107,6,109,113,127,121, %U A366303 131,137,139,149,119,143,151,157,163,167,169,173,179,181,191,12,133,193,197,199,211 %N A366303 Square array A(n, k), n, k > 0, read and filled by upwards antidiagonals the greedy way with distinct positive integers such that any two distinct terms in the same row or column are coprime. %C A366303 This sequence is a variant of A366030, with one less constraint. %C A366303 All the prime numbers appear in the sequence, in ascending order. %C A366303 For any prime number p, the first multiple of p in the sequence is p. %C A366303 Will every positive integer appear in the sequence? %H A366303 Rémy Sigrist, <a href="/A366303/a366303.png">Colored representation of the array for n, k <= 881</a> (grayish pixels correspond to prime numbers) %H A366303 Rémy Sigrist, <a href="/A366303/a366303.gp.txt">PARI program</a> %e A366303 Array A(n, k) begins: %e A366303 n\k | 1 2 3 4 5 6 7 8 9 10 %e A366303 ----+------------------------------------------------- %e A366303 1 | 1 3 4 13 23 35 67 89 121 167 %e A366303 2 | 2 7 11 15 41 61 83 127 163 199 %e A366303 3 | 5 8 21 37 59 79 113 157 197 247 %e A366303 4 | 9 19 31 14 55 109 151 193 221 307 %e A366303 5 | 17 25 53 73 6 143 133 241 293 353 %e A366303 6 | 29 47 65 107 119 12 239 283 349 401 %e A366303 7 | 43 71 103 149 191 233 10 33 161 463 %e A366303 8 | 49 101 139 181 229 281 27 16 95 451 %e A366303 9 | 97 137 179 227 277 323 341 91 18 115 %e A366303 10 | 131 173 223 253 347 397 461 85 613 24 %o A366303 (PARI) See Links section. %Y A366303 Cf. A336349, A366030, A366304. %K A366303 nonn,tabl %O A366303 1,2 %A A366303 _Rémy Sigrist_, Oct 06 2023