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 A110713 #50 Sep 20 2021 21:58:33
%S A110713 1,3,10,25,91,196,750,1485,3025,5566,23387,38402,163268,284376,500004,
%T A110713 795549,3575781,5657839,25413850,40027130,66010230,105164280,
%U A110713 490429875,713491350,1232253906
%N A110713 a(n) is the number of distinct products b_1*b_2*...*b_n where 1 <= b_i <= n.
%C A110713 If * is changed to + the result is A002061. - _Michel Marcus_ and _David Galvin_, Sep 19 2021
%H A110713 Gerhard Kirchner, <a href="/A110713/a110713.pdf">Theory and aspects of extension</a>
%e A110713 a(2) = A027424(2) = 3.
%e A110713 a(3) = A027425(3) = 10.
%e A110713 a(4) = A100437(4) = 25.
%o A110713 (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
%o A110713 (Python)
%o A110713 from math import prod
%o A110713 from itertools import combinations_with_replacement
%o A110713 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
%Y A110713 Main diagonal of A322967.
%Y A110713 Cf. A110713, A027424, A027425, A100437, A345882.
%K A110713 nonn,more
%O A110713 1,2
%A A110713 _Jonas Wallgren_, Sep 15 2005
%E A110713 a(10)-a(15) from _Donovan Johnson_, Dec 08 2009
%E A110713 a(16)-a(25) from _Gerhard Kirchner_, Dec 07 2015