%I #11 Oct 02 2015 12:21:17
%S 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 61,65,72,73,77,79,81,84,86,87,88,92,93,94,96,97,98,99,101,102,103,
%U 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 Numbers where A049820 takes a unique value; numbers n for which A060990(A049820(n)) = 1.
%C Sequence A262512 sorted into ascending order.
%C Numbers n such that there is no other number k for which A049820(k) = A049820(n).
%H Antti Karttunen, <a href="/A262513/b262513.txt">Table of n, a(n) for n = 1..45700</a>
%t 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 (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A262513 (MATCHING-POS 1 1 (lambda (n) (= 1 (A060990 (A049820 n))))))
%Y Cf. A060990, A049820, A262511, A262512.
%Y Cf. A262509 (a subsequence).
%K nonn
%O 1,1
%A _Antti Karttunen_, Sep 25 2015