cp's OEIS Frontend

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.

A290149 Totient sublime numbers: numbers k such that the number of terms in the iterations of phi(k) from k to 1, A032358(k)+2, and their sum, A092693(k) are both perfect totient numbers (A082897).

This page as a plain text file.
%I A290149 #15 Jul 23 2021 02:25:16
%S A290149 6,2916,4374,109100,113708,3188646
%N A290149 Totient sublime numbers: numbers k such that the number of terms in the iterations of phi(k) from k to 1, A032358(k)+2, and their sum, A092693(k) are both perfect totient numbers (A082897).
%C A290149 Analogous to A081357 (sublime numbers), as A082897 (perfect totient numbers) is analogous to A000396 (perfect numbers).
%C A290149 No other terms below 10^8.
%e A290149 There are 9 terms in the iterations of phi(k) for 2916: 2916, 972, 324, 108, 36, 12, 4, 2, 1. Their sum is 4375. Both 9 and 4375 are perfect totient numbers (A082897).
%t A290149 iterList [n_] := FixedPointList[EulerPhi@# &, n]; sumIter [n_] := Plus @@ iterList[n] - 1; numIter[n_] := Length[iterList[n]] - 1; perfTotQ[n_] := sumIter[n] == 2 n; totSublimeQ[n_] := perfTotQ[numIter[n]] && perfTotQ[sumIter[n]]; Select[Range [10^8], totSublimeQ]
%Y A290149 Cf. A032358, A081357, A082897, A092693.
%K A290149 nonn,more
%O A290149 1,1
%A A290149 _Amiram Eldar_, Jul 21 2017