|
%I #44 Jun 20 2023 01:00:41
%S 1,2,2,4,2,5,2,7,4,5,2,11,2,5,5,12,2,11,2,11,5,5,2,21,4,5,7,11,2,15,2,
%T 19,5,5,5,26,2,5,5,21,2,15,2,11,11,5,2,38,4,11,5,11,2,21,5,21,5,5,2,
%U 36,2,5,11,30,5,15,2,11,5,15,2,52,2,5,11,11,5,15,2,38,12,5,2,36,5,5,5,21
%N Number of partitions of n where the product of parts divides n.
%C a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24=2^3*3 and 375=3*5^3 both have prime signature (3,1). - _Christian G. Bower_, Jun 03 2005
%H Antti Karttunen, <a href="/A057567/b057567.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F a(n) = Sum_{d|n} A001055(d). - _Vladeta Jovovic_, Nov 19 2000
%F a(A025487(n)) = A108464(n).
%F a(p^k) = A000070(k).
%F a(A002110(n)) = A000110(n+1).
%F Dirichlet g.f.: zeta(s) * Product_{k>=2} 1/(1 - 1/k^s). - _Ilya Gutkovskiy_, Nov 03 2020
%e From _Gus Wiseman_, Jul 04 2019: (Start)
%e The a(1) = 1 through a(9) = 5 partitions are the following. The Heinz numbers of these partitions are given by A326155.
%e (1) (2) (3) (4) (5) (6) (7) (8)
%e (11) (111) (22) (11111) (321) (1111111) (4211)
%e (211) (3111) (22211)
%e (1111) (21111) (41111)
%e (111111) (221111)
%e (2111111)
%e (11111111)
%e (End)
%t Table[Function[m, Count[Map[Times @@ # &, IntegerPartitions[m]], P_ /; Divisible[m, P]] - Boole[n == 1]]@ Apply[Times, #] &@ MapIndexed[Prime[First@ #2]^#1 &, Sort[FactorInteger[n][[All, -1]], Greater]], {n, 88}] (* _Michael De Vlieger_, Aug 16 2017 *)
%o (PARI)
%o fcnt(n, m) = {local(s); s=0; if(n == 1, s=1, fordiv(n, d, if(d > 1 & d <= m, s=s+fcnt(n/d, d)))); s}
%o A001055(n) = fcnt(n, n) \\ This function from _Michael B. Porter_, Oct 29 2009
%o A057567(n) = sumdiv(n, d, A001055(d)); \\ After Jovovic's formula. _Antti Karttunen_, May 25 2017
%o (Python)
%o from sympy import divisors, isprime
%o def T(n, m):
%o if isprime(n): return 1 if n <= m else 0
%o A = (d for d in divisors(n) if 1 < d < n and d <= m)
%o s = sum(T(n // d, d) for d in A)
%o return s + 1 if n <= m else s
%o def a001055(n): return T(n, n)
%o def a(n): return sum(a001055(d) for d in divisors(n))
%o print([a(n) for n in range(1, 51)]) # _Indranil Ghosh_, Aug 19 2017
%Y Cf. A000070, A000110, A001055 (Mobius transform), A002110, A025487, A057568, A108464, A113309, A131802.
%Y Any prime numbered column of array A108461.
%Y Cf. A028422, A096276, A114324, A318950, A319000, A319005, A326152, A326155.
%K nonn
%O 1,2
%A _Leroy Quet_, Oct 04 2000
%E More terms from _James A. Sellers_, Oct 09 2000
%E More terms from _Vladeta Jovovic_, Nov 19 2000
|
