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 A240968 #29 Sep 21 2019 21:56:26 %S A240968 5,8,10,41,206,1066,2412,3281,8086,11570,29525,57012,73728,410390, %T A240968 413486,775130,2391485,2454146,2937446,64563520,100531166,152032126, %U A240968 988747406 %N A240968 Unitary anti-perfect numbers. %C A240968 For any number x we consider the sum of its anti-divisors which are coprime to x (unitary anti-divisors). The sequence list the numbers for which this sum is equal to x. %C A240968 Subset of A192270. %C A240968 I found only 2 unitary anti-amicable numbers: 18208, 20470. %C A240968 No other terms < 2147000000. _Jud McCranie_, Sep 21 2019. %e A240968 Anti-divisors of 1066 are 3, 4, 9, 27, 52, 79, 164, 237, 711. The anti-divisors which are coprime to 1066 are 3, 9, 27, 79, 237, 711 and their sum is 3 + 9 + 27 + 79 + 237 + 711 = 1066. %p A240968 P:=proc(q) local a,k,n; %p A240968 for n from 3 to q do a:=0; b:=0; %p A240968 for k from 2 to n-1 do if abs((n mod k)-k/2)<1 then %p A240968 if gcd(n,k)=1 then a:=a+k; fi; fi; od; %p A240968 if n=a then print(n); fi; od; end: P(10^6); %Y A240968 Cf. A066272, A066417, A073930, A192270, A240979. %K A240968 nonn,more %O A240968 1,1 %A A240968 _Paolo P. Lava_, Aug 05 2014 %E A240968 a(14)-a(23) by _Jud McCranie_, Sep 21 2019.