login
Unitary pseudoperfect numbers that equal to the sum of a subset of their aliquot unitary divisors in a single way.
4

%I #15 Jun 10 2020 04:14:06

%S 6,60,78,90,102,114,138,150,174,186,222,246,258,282,294,318,354,366,

%T 402,426,438,474,498,534,582,606,618,642,654,678,726,750,762,786,822,

%U 834,894,906,942,978,1002,1014,1038,1074,1086,1146,1158,1182,1194,1266,1338

%N Unitary pseudoperfect numbers that equal to the sum of a subset of their aliquot unitary divisors in a single way.

%C The unitary version of A064771.

%C It appears that most of the terms are divisible by 3. Terms that are not divisible by 3 are 3770, 5530, 7210, 7630, ... - _Michel Marcus_, Dec 15 2017

%C The least odd term is 442365. - _Amiram Eldar_, Jun 10 2020

%H Amiram Eldar, <a href="/A295829/b295829.txt">Table of n, a(n) for n = 1..10000</a>

%e 150 is in the sequence since its aliquot unitary divisors are 1, 2, 3, 6, 25, 50, 75 and there is only one subset whose sum is 150: {25, 50, 75}.

%t ud[n_] := Block[{d = Divisors[n]}, Select[d, GCD[#, n/#] == 1 &]];

%t a = {}; n = 0; While[Length[a] < 100, n++; d = Most[ud[n]];

%t c = SeriesCoefficient[Series[Product[1 + x^d[[i]], {i, Length[d]}], {x, 0, n}], n]; If[c ==1, AppendTo[a, n]]]; a

%Y Cf. A064771, A293188.

%K nonn

%O 1,1

%A _Amiram Eldar_, Nov 28 2017