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 A378735 #9 Dec 06 2024 20:44:25
%S A378735 6,9,10,8,15,9,10,21,16,27,28,15,33,35,9,39,16,28,44,45,32,50,51,52,
%T A378735 27,28,57,15,63,44,69,35,16,75,52,32,81,28,87,44,45,93,64,98,99,50,68,
%U A378735 52,105,27,110,111,32,76,117,16,123,63,129,130,44,135,136,92,35,141,32,147,75,152,153,154,52,159,64,81,165
%N A378735 Greatest non-abundant divisor of the n-th abundant number.
%H A378735 Antti Karttunen, <a href="/A378735/b378735.txt">Table of n, a(n) for n = 1..20000</a>
%F A378735 a(n) = A378665(A005101(n)).
%F A378735 a(n) >= A378736(n).
%o A378735 (PARI)
%o A378735 A294935(n) = (sigma(n)<=(2*n));
%o A378735 A378665(n) = { fordiv(n,d,if(A294935(n/d), return(n/d))); (1); };
%o A378735 k=0; n=0; while(k<105, n++; if(!A294935(n), k++; print1(A378665(n),", ")));
%Y A378735 Cf. A005101, A294935, A378665.
%Y A378735 Cf. also A378736 and the points of differences A378737.
%K A378735 nonn
%O A378735 1,1
%A A378735 _Antti Karttunen_, Dec 06 2024