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 A111667 #10 Jun 02 2024 14:40:10 %S A111667 4,2,12,12,10,12,12,8,12,4,12,56,4,12,2,12,120,12,56,12,12,12,56,78, %T A111667 12,12,180,12,56,12,12,56,12,8,12,12,12,2,12,56,12,56,12,12,12,12,12, %U A111667 56,2,12,672,12,12,12,56,12,12,8,56,12,12,12,30,12,32,12,56,12,12,12,12,56 %N A111667 Abundance of admirable numbers. %H A111667 Amiram Eldar, <a href="/A111667/b111667.txt">Table of n, a(n) for n = 1..10000</a> %e A111667 a(1)=4 because the first admirable number is 12 and sigma(12)-24 = 4. %t A111667 fn[n_]:=DivisorSigma[1,n]-2*n;fn/@Select[Range[1155], MemberQ[Most[Divisors[#]], (DivisorSigma[1, #]-2*#)/2]&] (* _James C. McMahon_, Jun 02 2024 *) %Y A111667 Cf. A033880, A111592. %K A111667 easy,nonn %O A111667 1,1 %A A111667 _Jason Earls_, Aug 14 2005