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 A371246 #11 Mar 16 2024 17:25:09 %S A371246 1,2,3,4,6,5,7,10,8,9,11,15,13,12,14,16,21,19,22,18,17,20,28,26,23,25, %T A371246 24,27,29,34,40,31,35,37,30,32,33,45,41,46,36,39,43,38,42,44,51,53,48, %U A371246 52,56,47,49,50,54,55,64,60,61,62,58,66,59,67,68,57 %N A371246 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 n > 0, the terms in the n-th row are congruent modulo n. %C A371246 Every integer appears in the sequence (as each row starts with the least missing value). %H A371246 Rémy Sigrist, <a href="/A371246/b371246.txt">Table of n, a(n) for n = 1..10011</a> %H A371246 Rémy Sigrist, <a href="/A371246/a371246.gp.txt">PARI program</a> %H A371246 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %e A371246 Array A(n, k) begins: %e A371246 n\k | 1 2 3 4 5 6 7 8 9 10 %e A371246 ----+-------------------------------------------- %e A371246 1 | 1 3 5 9 14 17 27 32 42 54 %e A371246 2 | 2 6 8 12 18 24 30 38 50 68 %e A371246 3 | 4 10 13 22 25 37 43 49 67 73 %e A371246 4 | 7 15 19 23 35 39 47 59 75 79 %e A371246 5 | 11 21 26 31 36 56 66 71 81 106 %e A371246 6 | 16 28 40 46 52 58 70 82 100 112 %e A371246 7 | 20 34 41 48 62 76 83 90 118 139 %e A371246 8 | 29 45 53 61 85 93 101 109 125 149 %e A371246 9 | 33 51 60 69 96 105 123 141 150 168 %e A371246 10 | 44 64 74 84 94 114 124 134 144 164 %o A371246 (PARI) See Links section. %Y A371246 See A371236 and A371248 for similar sequences. %Y A371246 Cf. A371247 (inverse). %K A371246 nonn,tabl %O A371246 1,2 %A A371246 _Rémy Sigrist_, Mar 16 2024