cp's OEIS Frontend

A371236 Triangle T(n, k), n > 0, k = 1..n, read and filled in the greedy way by rows with distinct positive integers such that for any n > 0, the terms in the n-th row are congruent modulo n.

%I A371236 #13 Mar 16 2024 17:27:01
%S A371236 1,2,4,3,6,9,5,13,17,21,7,12,22,27,32,8,14,20,26,38,44,10,24,31,45,52,
%T A371236 59,66,11,19,35,43,51,67,75,83,15,33,42,60,69,78,87,96,105,16,36,46,
%U A371236 56,76,86,106,116,126,136,18,29,40,62,73,84,95,117,128,139,150
%N A371236 Triangle T(n, k), n > 0, k = 1..n, read and filled in the greedy way by rows with distinct positive integers such that for any n > 0, the terms in the n-th row are congruent modulo n.
%C A371236 Every integer appears in the sequence (as each row starts with the least missing value).
%H A371236 Rémy Sigrist, <a href="/A371236/b371236.txt">Table of n, a(n) for n = 1..10011</a> (rows for n = 1..141 flattened)
%H A371236 Rémy Sigrist, <a href="/A371236/a371236.gp.txt">PARI program</a>
%H A371236 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%e A371236 Triangle T(n, k) begins:
%e A371236                      1
%e A371236                    2   4
%e A371236                  3   6   9
%e A371236                5  13  17  21
%e A371236              7  12  22  27  32
%e A371236            8  14  20  26  38  44
%e A371236         10  24  31  45  52  59  66
%e A371236       11  19  35  43  51  67  75  83
%o A371236 (PARI) See Links section.
%Y A371236 See A075383, A371246 and A371248 for similar sequences.
%Y A371236 Cf. A371237 (inverse).
%K A371236 nonn,tabl
%O A371236 1,2
%A A371236 _Rémy Sigrist_, Mar 16 2024