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 A340034 #10 Apr 19 2021 09:52:38 %S A340034 1,1,1,1,1,2,1,1,1,2,1,2,3,1,3,4,1,1,1,1,1,1,1,3,2,2,5,2,4,4,7,3,6,1, %T A340034 4,1,9,7,1,1,1,1,1,1,3,7,4,2,2,3,1,6,2,1,7,3,10,1,11,5,9,7,2,17,5,5,1, %U A340034 9,11,1,2,10,1,1,12,1,1,14,9,3,2,10,1,4,1 %N A340034 a(n) is the number of ways to represent A025487(n) as a product of the largest possible number of distinct factors in the product. %H A340034 David A. Corneth, <a href="/A340034/b340034.txt">Table of n, a(n) for n = 1..10000</a> %e A340034 a(13) = 3 as there are three ways to represent A025487(13) = 60 as a product of largest possible number of distinct factors in the product. That number is 4 and the products are 1 * 2 * 3 * 10 = 1 * 2 * 5 * 6 = 1 * 3 * 4 * 5 = 60. %Y A340034 Cf. A025487, A338160. %K A340034 nonn,look %O A340034 1,6 %A A340034 _David A. Corneth_, Feb 04 2021