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 A286267 #12 May 07 2017 01:13:48
%S A286267 1,2,3,4,5,7,9,11,13,17,23,29,37,41,47,53,59,67,71,73,79,83,89,97,101,
%T A286267 107,127,131,137,149,167,179,221,223,227,233,251,257,289,317,347,353,
%U A286267 359,383,389,431,443,449,461,467,503,557,563,569,587,641,677,697
%N A286267 Totient highly abundant numbers: numbers n such that A092693(n)+n > A092693(m)+m for all m < n.
%C A286267 Analogous to A002093 (highly abundant numbers) as A082897 (perfect totient numbers) is analogous to A000396 (perfect numbers).
%H A286267 Amiram Eldar, <a href="/A286267/b286267.txt">Table of n, a(n) for n = 1..1000</a>
%H A286267 Paul Loomis and Florian Luca, <a href="https://www.emis.de/journals/INTEGERS/papers/i6/i6.Abstract.html">On totient abundant numbers</a>, Electronic Journal of Combinatorial Number Theory, Vol. 8, #A06 (2008).
%t A286267 Function[s, Flatten[First@ Position[s, #] & /@ Union@ Rest@ FoldList[Max, 0, s]]]@ Table[(Total@ FixedPointList[EulerPhi, n] - 1), {n, 10^3}] (* _Michael De Vlieger_, May 06 2017 *)
%Y A286267 Cf. A000396, A002093, A082897, A092693, A286265.
%K A286267 nonn
%O A286267 1,2
%A A286267 _Amiram Eldar_, May 05 2017