login
A062858
In the triangular multiplication table of size A062859(n), the smallest number which appears n times.
5
1, 4, 12, 36, 60, 120, 120, 360, 360, 360, 840, 840, 2520, 2520, 2520, 2520, 2520, 5040, 5040, 5040, 5040, 5040, 5040, 10080, 10080, 27720, 27720, 27720, 27720, 55440, 55440, 55440, 55440, 55440, 55440, 55440, 55440, 55440, 55440, 55440
OFFSET
1,2
COMMENTS
Smallest number to appear n times in any m X m multiplication table (excluding the numbers below the diagonals).
EXAMPLE
a(4)=36 because 36 is the smallest number to appear 4 times in the triangular multiplication table of size A062859(4)=18.
PROG
(Python)
from itertools import count
from collections import Counter
def A062858(n):
c = Counter()
for m in count(1):
for i in range(1, m+1):
ij = i*m
c[ij] += 1
if c[ij]>=n:
return ij # Chai Wah Wu, Oct 16 2023
KEYWORD
nonn
AUTHOR
Ron Lalonde (ronronronlalonde(AT)hotmail.com), Jun 25 2001
EXTENSIONS
More terms from Don Reble, Nov 08 2001
STATUS
approved