A365739 a(n)=A365339(10^n)-A365740(10^n).

0, 2, 3, 4, 15, 61, 881, 10394, 111047

Offset: 0

Author

Chai Wah Wu, Sep 17 2023

Keywords

• nonn
• hard
• more

Comments

Pollack et al. conjectured that a(n) > 2 for n > 4.

Links

• Paul Pollack, Carl Pomerance and Enrique Treviño, Sets of monotonicity for Euler's totient function, preprint. See M↑(n) and M2(n).
• Paul Pollack, Carl Pomerance and Enrique Treviño, Sets of monotonicity for Euler's totient function, Ramanujan J. 30 (2013), no. 3, 379--398.
• Terence Tao, Monotone non-decreasing sequences of the Euler totient function, arXiv:2309.02325 [math.NT], 2023.

Crossrefs

Cf. A000010, A000720.

Cf. A365339, A365398, A365399, A365400, A365474, A365737, A061070.