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 A288453 #9 Mar 27 2023 03:38:36
%S A288453 91,95,133,145,185,203,215,217,259,275,301,335,343,355,365,395,427,
%T A288453 469,497,545,551,553,575,635,637,649,655,703,725,755,763,767,785,815,
%U A288453 817,833,865,889,893,905,917,931,949,955,973,985,995,1007,1027,1057,1073
%N A288453 Weird totient numbers: totient abundant numbers (A286265) that are not pseudoperfect totient numbers (A288452).
%C A288453 Analogous to A006037 (weird numbers) as A082897 (perfect totient numbers) is analogous to A000396 (perfect numbers).
%H A288453 Amiram Eldar, <a href="/A288453/b288453.txt">Table of n, a(n) for n = 1..10000</a>
%e A288453 The set of iterated phi of 91 is {72, 24, 8, 4, 2, 1} and none of its subsets sums to 91.
%t A288453 pseudoPerfectTotQ[n_] := Module[{tots = Most[Rest[FixedPointList[EulerPhi@# &, n]]]}, MemberQ[Total /@ Subsets[tots, Length[tots]], n]];
%t A288453 totAbundantQ[n_] := Plus @@ FixedPointList[EulerPhi@# &, n] > 2*n + 1;
%t A288453 weirdTotient[n_] := totAbundantQ[n] && ! pseudoPerfectTotQ[n];
%t A288453 Select[Range[1100], weirdTotient]
%Y A288453 Cf. A000010, A000396, A006037, A092693, A082897, A286265.
%K A288453 nonn
%O A288453 1,1
%A A288453 _Amiram Eldar_, Jun 09 2017