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 A262513 #11 Oct 02 2015 12:21:17
%S A262513 5,6,7,8,11,14,17,18,20,22,23,24,27,32,34,35,40,43,46,47,50,51,57,58,
%T A262513 61,65,72,73,77,79,81,84,86,87,88,92,93,94,96,97,98,99,101,102,103,
%U A262513 105,107,114,116,119,120,123,125,130,135,137,143,151,154,155,158,160,163,164,173,175,177,179,184,187,191,193,194,197,198,200,203,204,206,209,210,212
%N A262513 Numbers where A049820 takes a unique value; numbers n for which A060990(A049820(n)) = 1.
%C A262513 Sequence A262512 sorted into ascending order.
%C A262513 Numbers n such that there is no other number k for which A049820(k) = A049820(n).
%H A262513 Antti Karttunen, <a href="/A262513/b262513.txt">Table of n, a(n) for n = 1..45700</a>
%t A262513 lim = 212; s = Table[n - DivisorSigma[0, n], {n, 2 lim + 3}]; t = Length@ Position[s, #] & /@ Range[0, lim]; Position[t[[# + 1]] & /@ Take[s, lim], 1] // Flatten (* _Michael De Vlieger_, Sep 29 2015, after _Wesley Ivan Hurt_ at A049820 *)
%o A262513 (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o A262513 (define A262513 (MATCHING-POS 1 1 (lambda (n) (= 1 (A060990 (A049820 n))))))
%Y A262513 Cf. A060990, A049820, A262511, A262512.
%Y A262513 Cf. A262509 (a subsequence).
%K A262513 nonn
%O A262513 1,1
%A A262513 _Antti Karttunen_, Sep 25 2015