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 A371420 #6 Mar 23 2024 08:23:16
%S A371420 14,62,124,189,254,508,2032,16382,32764,131056,262142,524284,524224,
%T A371420 1048574,2097148,2097136,8388592,8388544,33554368,536866816,
%U A371420 2147479552,4294967294,8589934588,34359738352,34359672832,137438953408
%N A371420 Greater member of Carmichael's variant of amicable pair: numbers k < m such that s(k) = m and s(m) = k, where s(k) = A371418(k).
%C A371420 The terms are ordered according to their lesser counterparts (A371419).
%H A371420 Robert D. Carmichael, <a href="https://doi.org/10.5951/MT.14.6.0305">Empirical Results in the Theory of Numbers</a>, The Mathematics Teacher, Vol. 14, No. 6 (1921), pp. 305-310; <a href="https://www.jstor.org/stable/27950349">alternative link</a>. See p. 309.
%e A371420 14 is a term since A371418(14) = 12 < 14, and A371418(12) = 14.
%t A371420 r[n_] := n/FactorInteger[n][[1, 1]]; s[n_] := r[DivisorSigma[1, n]]; seq = {}; Do[m = s[n]; If[m > n && s[m] == n, AppendTo[seq, m]], {n, 1, 10^6}]; seq
%o A371420 (PARI) f(n) = {my(s = sigma(n)); if(s == 1, 1, s/factor(s)[1, 1]);}
%o A371420 lista(nmax) = {my(m); for(n = 1, nmax, m = f(n); if(m > n && f(m) == n, print1(m, ", ")));}
%Y A371420 Cf. A371418, A371419.
%Y A371420 Similar sequences: A002046, A002953, A126166, A126170, A259039, A292981, A322542, A324709, A348344.
%K A371420 nonn,more
%O A371420 1,1
%A A371420 _Amiram Eldar_, Mar 23 2024