login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of partitions of n in which, if the number of parts is k, the product of the parts is the k-th power of some positive integer.
32

%I #12 Sep 24 2023 13:04:35

%S 1,2,2,3,3,4,3,4,4,8,3,8,5,7,8,8,7,9,8,17,11,11,8,16,17,17,14,18,17,

%T 26,19,24,20,30,28,32,27,37,35,48,37,45,37,51,51,58,50,64,62,83,73,84,

%U 69,91,89,101,97,116,111,136,123,142,138,160,161,181,171,205,199,231,221

%N Number of partitions of n in which, if the number of parts is k, the product of the parts is the k-th power of some positive integer.

%C a(n) is the number of integer partitions of n whose geometric mean is an integer. - _Gus Wiseman_, Jul 19 2019

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Geometric_mean">Geometric mean</a>

%e From _Gus Wiseman_, Jul 19 2019: (Start)

%e The a(1) = 1 through a(8) = 4 partitions:

%e (1) (2) (3) (4) (5) (6) (7) (8)

%e (11) (111) (22) (41) (33) (421) (44)

%e (1111) (11111) (222) (1111111) (2222)

%e (111111) (11111111)

%e (End)

%t Table[Length[Select[IntegerPartitions[n],IntegerQ[GeometricMean[#]]&]],{n,30}] (* _Gus Wiseman_, Jul 19 2019 *)

%o (Python)

%o from math import prod

%o from sympy import integer_nthroot

%o from sympy.utilities.iterables import partitions

%o def A067539(n): return sum(1 for s,p in partitions(n,size=True) if integer_nthroot(prod(a**b for a, b in p.items()),s)[1]) # _Chai Wah Wu_, Sep 24 2023

%Y Partitions with integer average are A067538.

%Y Subsets whose geometric mean is an integer are A326027.

%Y The Heinz numbers of these partitions are A326623.

%Y The strict case is A326625.

%Y Cf. A000041, A102627, A320322, A326028, A326641.

%K easy,nonn

%O 1,2

%A _Naohiro Nomoto_, Jan 27 2002

%E Terms a(61) onwards from _Max Alekseyev_, Feb 06 2010