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 A238229 #26 Jun 14 2022 08:51:35 %S A238229 2,4,20,66,342,34092,40842,41922,46242,55422,207624,259448,533172, %T A238229 547300,571992,667408,1531032,1786288,10983114,114013752,133506680, %U A238229 323277822,347360860,386144360,387415458,459603716,476991704,1443279992,1539484232,15537978552 %N A238229 Numbers n such that if x = sigma(n)-phi(n)+tau(n)-n then n = sigma(x)-phi(x)+tau(x)-x. %C A238229 The fixed points (terms with x = n) are 2, 4, 20, 66, 342, 41922, 10983114, ... - _Amiram Eldar_, Mar 31 2019 %H A238229 Kevin P. Thompson, <a href="/A238229/b238229.txt">Table of n, a(n) for n = 1..38</a> %e A238229 Fixed points: 2, 4, 20, 66, 342, 41922, ... %e A238229 Amicable pairs: (34092, 40842), (46242, 55422), (207624, 259448), ... %e A238229 sigma(34092) = 86268, phi(34092) = 11352, tau(34092) = 18 and 86268 - 11352 + 18 - 34092 = 40842. %e A238229 sigma(40842) = 88530, phi(40842) = 13608, tau(40842) = 12 and 88530 - 13608 + 12 - 40842 = 34092. %p A238229 with(numtheory); P:=proc(q)local a,n; %p A238229 for n from 1 to q do a:=sigma(n)-phi(n)+tau(n)-n; %p A238229 if a>0 and sigma(a)-phi(a)+tau(a)-a=n then print(n); %p A238229 fi; od; end: P(10^6); %t A238229 f[n_] := If[n > 0, DivisorSigma[1, n] - EulerPhi[n] + DivisorSigma[0, n] - n, 0]; s={}; Do[ If[f[f[n]] == n, AppendTo[s, n]], {n, 1, 60000}]; s (* _Amiram Eldar_, Mar 31 2019 *) %Y A238229 Cf. A000005, A000010, A000203. %Y A238229 Cf. A238225, A238226, A238227, A238228, A238230. %K A238229 nonn %O A238229 1,1 %A A238229 _Paolo P. Lava_, Feb 20 2014 %E A238229 a(11)-a(29) from _Amiram Eldar_, Mar 31 2019 %E A238229 a(30) from _Giovanni Resta_, Apr 04 2019