|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
|
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|