Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Aug 12 2023 02:29:08
%S 198,1210,2220,6368,10856,66992,525915,652664,5495264,7684672,
%T 13727466,16150628,25640096,26138475,28128368,33642028,34380688,
%U 40803868,133471275
%N Greater of a pair of S-amicable numbers k < m such that s(k) = m and s(m) = k, where s(k) = A364858(k).
%C S-amicable numbers are analogous to amicable numbers (A002025/A002046) as S-perfect numbers (A118372) are analogous to perfect numbers (A000396).
%C The terms are ordered according to their lesser counterparts (A364859).
%F a(n) = A364858(A364859(n)).
%e 198 is a term since A364858(198) = 186 < 198, and A364858(186) = 198.
%t seq[nmax_] := Module[{s = {1}, sum, sum2, am = {}, ak}, Do[sum = Total[Select[Divisors[n], MemberQ[s, #] &]]; If[sum <= n, AppendTo[s, n]; If[sum < n, sum2 = Total[Select[Most[Divisors[sum]], MemberQ[s, #] &]]; If[sum2 == n, AppendTo[am, n]]]], {n, 2, nmax}]; am]; seq[10^4]
%o (PARI) lista(nmax) = {my(c = 0, s, s2); for(n=2, nmax, s = sumdiv(n, d, !bittest(c, d)*d) - n; if(s > n, c+=1<<n); if(s < n, s2 = sumdiv(s, d, ((d<s)&&!bittest(c, d))*d); if(s2 == n, print1(n,", "))));} \\ after _M. F. Hasler_ at A181487
%Y Cf. A000396, A002025, A002046, A118372, A364858, A364859.
%K nonn,more
%O 1,1
%A _Amiram Eldar_, Aug 11 2023