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 A295829 #15 Jun 10 2020 04:14:06
%S A295829 6,60,78,90,102,114,138,150,174,186,222,246,258,282,294,318,354,366,
%T A295829 402,426,438,474,498,534,582,606,618,642,654,678,726,750,762,786,822,
%U A295829 834,894,906,942,978,1002,1014,1038,1074,1086,1146,1158,1182,1194,1266,1338
%N A295829 Unitary pseudoperfect numbers that equal to the sum of a subset of their aliquot unitary divisors in a single way.
%C A295829 The unitary version of A064771.
%C A295829 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 A295829 The least odd term is 442365. - _Amiram Eldar_, Jun 10 2020
%H A295829 Amiram Eldar, <a href="/A295829/b295829.txt">Table of n, a(n) for n = 1..10000</a>
%e A295829 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 A295829 ud[n_] := Block[{d = Divisors[n]}, Select[d, GCD[#, n/#] == 1 &]];
%t A295829 a = {}; n = 0; While[Length[a] < 100, n++; d = Most[ud[n]];
%t A295829 c = SeriesCoefficient[Series[Product[1 + x^d[[i]], {i, Length[d]}], {x, 0, n}], n]; If[c ==1, AppendTo[a, n]]]; a
%Y A295829 Cf. A064771, A293188.
%K A295829 nonn
%O A295829 1,1
%A A295829 _Amiram Eldar_, Nov 28 2017