A143421 Number of odd numbers k such that phi(k) = n, where n runs through the values (A002202) taken by phi.
1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 3, 1, 1, 1, 3, 3, 2, 1, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1, 6, 1, 2, 1, 2, 2, 1, 4, 2, 1, 1, 1, 4, 1, 2, 1, 6, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 3, 2, 2, 1, 1, 4, 1, 2, 1, 5, 1, 1, 4, 1, 1, 3, 1, 1, 1, 1, 7, 2, 1, 2, 1, 1, 2, 1, 10, 1, 4, 1, 1, 1, 3, 1, 1, 2, 4, 3, 1, 6, 1, 1, 1, 2, 1, 1, 6
Offset: 1
Keywords
References
- R. K. Guy, Unsolved problems in number theory, B39.
Links
- T. D. Noe, Table of n, a(n) for n=1..10000
- T. D. Noe, Numbers Like 16842752
- William P. Wardlaw, L. L. Foster and R. J. Simpson, Problem E3361, Amer. Math. Monthly, Vol. 98, No. 5 (May, 1991), 443-444.
Comments