A062858 In the triangular multiplication table of size A062859(n), the smallest number which appears n times.

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).

Links

Table of n, a(n) for n=1..40.

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

Crossrefs

Cf. A027424, A062851, A062854, A062855, A062856, A062857, A062859, A000217.

Sequence in context: A233181 A053595 A300553 * A095735 A020875 A307182

Adjacent sequences: A062855 A062856 A062857 * A062859 A062860 A062861

Keyword

nonn

Author

Ron Lalonde (ronronronlalonde(AT)hotmail.com), Jun 25 2001

Extensions

More terms from Don Reble, Nov 08 2001

Status

approved