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 A340792 #33 Jan 30 2021 11:39:02 %S A340792 1,2,3,4,4,5,6,6,7,8,8,9,9,10,10,11,12,12,12,13,14,14,15,15,16,16,16, %T A340792 17,18,18,18,19,20,20,20,21,21,22,22,23,24,24,24,24,25,25,26,26,27,27, %U A340792 28,28,28,29,30,30,30,30,31,32,32,32,33,33,34,34,35,35,36,36,36,36,36 %N A340792 List in which n appears ceiling(d(n)/2) = A038548(n) times, where d(n) is the number of divisors of n. %C A340792 The numbers in A075362 arranged in numerical order. %H A340792 Charles Kusniec, <a href="/A340792/a340792_2.png">Bijection between OEIS sequence A340792 and the positive Triangular Multiplication Table</a> %F A340792 T(n,k) = A161906(n,k) * A340791(n,k). %e A340792 Array begins: %e A340792 1 %e A340792 2 %e A340792 3 %e A340792 4 4 %e A340792 5 %e A340792 6 6 %e A340792 7 %e A340792 8 8 %e A340792 9 9 %e A340792 10 10 %e A340792 11 %e A340792 12 12 12 %e A340792 13 %e A340792 14 14 %e A340792 15 15 %e A340792 16 16 16 %e A340792 17 %e A340792 18 18 18 %e A340792 19 %e A340792 20 20 20 %e A340792 21 21 %e A340792 22 22 %e A340792 23 %e A340792 24 24 24 24 %o A340792 (PARI) row(n) = my(d=divisors(n), r1=select(x->(x<=sqrt(n)), d), r2=Vecrev(select(x->(x>=sqrt(n)), d))); vector(#r1, k, r1[k]*r2[k]); \\ _Michel Marcus_, Jan 22 2021 %Y A340792 Cf. A038548 (row lengths), A075362, A161906, A340791, A061017 (comparable array). %K A340792 nonn,tabf %O A340792 1,2 %A A340792 _Charles Kusniec_, Jan 21 2021