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 A286268 #16 Jul 28 2019 21:43:42
%S A286268 1,2,3,5,11,17,83,137,257,2879,46049,65537
%N A286268 Totient superabundant numbers: numbers n such that A092693(n)/n > A092693(m)/m for all m < n.
%C A286268 Analogous to A004394 (superabundant numbers) as A082897 (perfect totient numbers) is analogous to A000396 (perfect numbers).
%C A286268 The first 6 terms of A092506 (primes of the form 2^n + 1) are in this sequence.
%C A286268 a(13) > 1.6*10^10, if it exists. - _Giovanni Resta_, May 05 2017
%H A286268 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 A286268 Function[s, Flatten[First@ Position[s, #] & /@ Union@ Rest@ FoldList[Max, 0, s]]]@ Table[(Total@ FixedPointList[EulerPhi, n] - (n + 1))/n, {n, 10^5}] (* _Michael De Vlieger_, May 06 2017, after _Alonso del Arte_ at A092693 *)
%Y A286268 Cf. A000396, A004394, A082897, A092506, A092693, A286265, A286267.
%K A286268 nonn,more
%O A286268 1,2
%A A286268 _Amiram Eldar_, May 05 2017