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 A160095 #11 Sep 08 2022 08:45:44 %S A160095 3,4,6,6,7,8,8,9,10,11,12,13,13,14,14,15,15,16,16,17,17,18,19,19,20, %T A160095 20,21,21,21,22,22,23,23,24,25,25,25,26,27,27,28,29,29,30,31,31,31,31, %U A160095 31,32,32,33,33,33,34,35,35,35,36,37,37,37,37,38,39,40,40,40,41,41,41,41 %N A160095 Terms n > 1 of A001065, sorted. %C A160095 Term 1 occurs infinitely often in A001065, therefore terms <= 1 are excluded. %C A160095 n occurs in the present sequence with multiplicity A048138(n). %e A160095 6 occurs twice in the present sequence because there are two numbers m, viz. 6 and 25, for which A001065(m) = 6. %o A160095 (Magma) k:=1700; S:=[ a: n in [1..k] | a gt 1 and a le Sqrt(k) where a is SumOfDivisors(n)-n ]; Sort(~S); S; // _Klaus Brockhaus_, May 20 2009 %Y A160095 Cf. A001065 (sum of proper divisors of n), A048138 (a(n) = number of m such that sum of proper divisors of m is n). %K A160095 nonn %O A160095 1,1 %A A160095 _Jaroslav Krizek_, May 01 2009 %E A160095 Edited and extended by _Klaus Brockhaus_, May 20 2009