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 A371248 #11 Mar 16 2024 17:26:26 %S A371248 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, %T A371248 31,22,26,27,30,32,38,37,29,34,35,39,36,40,43,49,50,42,41,44,45,48,52, %U A371248 53,55,57,58,59,46,47,51,54,56,63,61,64,66,68,76,60 %N 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. %C A371248 Every integer appears in the sequence (as each column starts with the least missing value). %H A371248 Rémy Sigrist, <a href="/A371248/b371248.txt">Table of n, a(n) for n = 1..10011</a> %H A371248 Rémy Sigrist, <a href="/A371248/a371248.gp.txt">PARI program</a> %H A371248 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %e A371248 Array A(n, k) begins: %e A371248 n\k | 1 2 3 4 5 6 7 8 9 10 %e A371248 ----+-------------------------------------------- %e A371248 1 | 1 3 6 8 13 19 22 34 41 46 %e A371248 2 | 2 5 12 16 23 31 29 42 59 76 %e A371248 3 | 4 9 15 20 33 37 50 58 68 86 %e A371248 4 | 7 11 18 28 38 49 57 66 77 96 %e A371248 5 | 10 17 24 32 43 55 64 74 95 116 %e A371248 6 | 14 25 30 40 53 61 71 90 104 126 %e A371248 7 | 21 27 36 52 63 67 92 114 131 136 %e A371248 8 | 26 39 48 56 73 85 106 122 140 156 %e A371248 9 | 35 45 54 72 83 91 113 138 149 166 %e A371248 10 | 44 51 69 80 98 109 127 146 167 196 %o A371248 (PARI) See Links section. %Y A371248 See A371236 and A371246 for similar sequences. %Y A371248 Cf. A371249 (inverse). %K A371248 nonn,tabl %O A371248 1,2 %A A371248 _Rémy Sigrist_, Mar 16 2024