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 A361665 #7 Mar 24 2023 17:45:14 %S A361665 1,1,2,3,4,8,8,13,26,20,16,44,32,48,76,75,64,176,128,132,208,112,256, %T A361665 308,252,256,818,368,512,604,1024,541,544,576,768,1460,2048,1280,1376, %U A361665 1076,4096,1888,8192,976,3172,2816,16384,2612,2568,2316,3392,2496,32768 %N A361665 Number of ordered factorizations of p_1^x_1 * ... * p_k^x_k, where (x_1, ..., x_k) is the partition with Heinz number n and p_1, ..., p_k are distinct primes. %C A361665 Also, a(n) is the number of paths from (0, ..., 0) to P in which each step adds a nonnegative integer to each coordinate (and a positive number to at least one coordinate), where P is the partition with Heinz number n. %F A361665 a(n) = A074206(A181821(n)). %e A361665 The partition with Heinz number 6 is (1,2), and p^1*q^2 has 8 ordered factorizations, where p and q are distinct primes, so a(6) = 8. With p = 3 and q = 2, for example, we have the 8 = A074206(12) factorizations 12 = 2*6 = 3*4 = 4*3 = 6*2 = 2*2*3 = 2*3*2 = 3*2*2. %Y A361665 Cf. A074206, A181821, A361666. %K A361665 nonn %O A361665 1,3 %A A361665 _Pontus von Brömssen_, Mar 20 2023