login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A110713
a(n) is the number of distinct products b_1*b_2*...*b_n where 1 <= b_i <= n.
5
1, 3, 10, 25, 91, 196, 750, 1485, 3025, 5566, 23387, 38402, 163268, 284376, 500004, 795549, 3575781, 5657839, 25413850, 40027130, 66010230, 105164280, 490429875, 713491350, 1232253906
OFFSET
1,2
COMMENTS
If * is changed to + the result is A002061. - Michel Marcus and David Galvin, Sep 19 2021
EXAMPLE
a(2) = A027424(2) = 3.
a(3) = A027425(3) = 10.
a(4) = A100437(4) = 25.
PROG
(PARI) a(n) = my(l = List()); forvec(x = vector(n, i, [1, n]), listput(l, prod(i = 1, n, x[i])), 1); listsort(l, 1); #l \\ David A. Corneth, Jan 02 2019
(Python)
from math import prod
from itertools import combinations_with_replacement
def A110713(n): return len({prod(d) for d in combinations_with_replacement(list(range(1, n+1)), n)}) # Chai Wah Wu, Sep 19 2021
CROSSREFS
Main diagonal of A322967.
Sequence in context: A095052 A196984 A131433 * A098702 A100001 A227937
KEYWORD
nonn,more
AUTHOR
Jonas Wallgren, Sep 15 2005
EXTENSIONS
a(10)-a(15) from Donovan Johnson, Dec 08 2009
a(16)-a(25) from Gerhard Kirchner, Dec 07 2015
STATUS
approved