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 A062858 #9 Oct 16 2023 23:30:00 %S A062858 1,4,12,36,60,120,120,360,360,360,840,840,2520,2520,2520,2520,2520, %T A062858 5040,5040,5040,5040,5040,5040,10080,10080,27720,27720,27720,27720, %U A062858 55440,55440,55440,55440,55440,55440,55440,55440,55440,55440,55440 %N A062858 In the triangular multiplication table of size A062859(n), the smallest number which appears n times. %C A062858 Smallest number to appear n times in any m X m multiplication table (excluding the numbers below the diagonals). %e A062858 a(4)=36 because 36 is the smallest number to appear 4 times in the triangular multiplication table of size A062859(4)=18. %o A062858 (Python) %o A062858 from itertools import count %o A062858 from collections import Counter %o A062858 def A062858(n): %o A062858 c = Counter() %o A062858 for m in count(1): %o A062858 for i in range(1,m+1): %o A062858 ij = i*m %o A062858 c[ij] += 1 %o A062858 if c[ij]>=n: %o A062858 return ij # _Chai Wah Wu_, Oct 16 2023 %Y A062858 Cf. A027424, A062851, A062854, A062855, A062856, A062857, A062859, A000217. %K A062858 nonn %O A062858 1,2 %A A062858 Ron Lalonde (ronronronlalonde(AT)hotmail.com), Jun 25 2001 %E A062858 More terms from _Don Reble_, Nov 08 2001