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 A378660 #7 Dec 06 2024 20:44:20
%S A378660 1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,2,1,2,1,1,1,3,1,1,1,1,1,2,1,1,1,1,
%T A378660 1,4,1,1,1,4,1,2,1,1,1,1,1,3,1,1,1,1,1,2,1,2,1,1,1,4,1,1,1,1,1,2,1,1,
%U A378660 1,2,1,8,1,1,1,1,1,2,1,5,1,1,1,3,1,1,1,2,1,2,1,1,1,1,1,3,1,1,1,2,1,2,1,2,1
%N A378660 Smallest divisor d of n for which n/d is non-abundant, i.e. sigma(n/d) <= 2*(n/d).
%H A378660 Antti Karttunen, <a href="/A378660/b378660.txt">Table of n, a(n) for n = 1..100000</a>
%F A378660 a(n) = n / A378665(n).
%o A378660 (PARI)
%o A378660 A294935(n) = (sigma(n)<=(2*n));
%o A378660 A378660(n) = { fordiv(n,d,if(A294935(n/d), return(d))); (n); };
%Y A378660 Cf. A000203, A263837, A294935, A378665.
%K A378660 nonn
%O A378660 1,12
%A A378660 _Antti Karttunen_, Dec 06 2024