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 A335937 #9 Jul 02 2020 03:51:56
%S A335937 6,60,72,78,88,90,96,102,104,114,138,150,174,186,222,246,258,282,294,
%T A335937 318,354,366,402,426,438,474,486,498,534,582,606,618,642,654,678,726,
%U A335937 762,786,822,834,894,906,942,978,1002,1014,1038,1074,1086,1146,1158,1182,1194
%N A335937 Infinitary pseudoperfect numbers (A306983) that equal to the sum of a subset of their aliquot infinitary divisors in a single way.
%H A335937 Amiram Eldar, <a href="/A335937/b335937.txt">Table of n, a(n) for n = 1..3000</a>
%e A335937 72 is a term since its set of infinitary aliquot divisors is {1, 2, 4, 8, 9, 18, 36}, and {1, 8, 9, 18, 36} is its only subset whose sum is equal to 72.
%t A335937 idivs[x_] := If[x == 1, 1, Sort @ Flatten @ Outer[Times, Sequence @@ (FactorInteger[x] /. {p_, m_Integer} :> p^Select[Range[0, m], BitOr[m, #] == m &])]]; infpspQ[n_] := Module[{d = Most @ idivs[n], x}, Plus @@ d >= n && SeriesCoefficient[Series[Product[1 + x^d[[i]], {i, Length[d]}], {x, 0, n}], n] == 1]; Select[Range[2, 1200], infpspQ]
%Y A335937 The infinitary version of A064771.
%Y A335937 Subsequence of A306983.
%Y A335937 A007357 is a subsequence.
%Y A335937 Similar sequences: A295829, A295830, A321145.
%Y A335937 Cf. A049417, A077609, A335199.
%K A335937 nonn
%O A335937 1,1
%A A335937 _Amiram Eldar_, Jun 30 2020