A072074 -id:A072074 - cp's OEIS frontend

A072075 Smallest solution to phi(x) = 10^n where phi(x) = A000010(x).

1, 11, 101, 1111, 10291, 100651, 1004251, 10165751, 100064101, 1000078501, 10000222501, 100062501601, 1000062516001, 10000062660001, 100002441447211, 1003922328562757, 10000390625025601, 100000002482366251, 1000000002851006251, 10000062500000160001

Offset: 0

Labos Elemer, Jun 13 2002

nonn

			n=3: a(3)=1111 because InvPhi[1000]= {1111,1255,1375,1875,2008,2222,2500,2510,2750,3012,3750}.

Ray Chandler, Table of n, a(n) for n = 0..1000
Max A. Alekseyev, Computing the Inverses, their Power Sums, and Extrema for Euler's Totient and Other Multiplicative Functions. Journal of Integer Sequences, Vol. 19 (2016), Article 16.5.2

Cf. A000010, A014573, A014197, A110077, A072074, A072076.

More terms from Max Alekseyev, Apr 26 2010

a(18)-a(19) from Donovan Johnson, Feb 02 2012

A072076 Largest k such that EulerPhi(k) = 10^n.

Original entry on oeis.org

2, 22, 250, 3750, 41250, 414150, 4166250, 42281250, 438281250, 4400343750, 44266406250, 449238281250, 4510352343750, 45373066406250, 455545586718750, 4555455867187500, 45555287544813750, 455552875448137500, 4566844506855468750, 45668445068554687500

Offset: 0

Labos Elemer, Jun 13 2002

nonn

			n=3: a(3)=3750 because InvPhi(1000) = {1111, 1255, 1375, 1875, 2008, 2222, 2500, 2510, 2750, 3012, 3750}.

Ray Chandler, Table of n, a(n) for n = 0..1000
Max A. Alekseyev, Computing the Inverses, their Power Sums, and Extrema for Euler's Totient and Other Multiplicative Functions. Journal of Integer Sequences, Vol. 19 (2016), Article 16.5.2

Cf. A000010, A014197, A014573, A072074, A072075, A110076.

a(n) = Max{k; A000010(k) = 10^n}.

More terms from Max Alekseyev, Apr 26 2010

cp's OEIS Frontend

A072075 Smallest solution to phi(x) = 10^n where phi(x) = A000010(x).

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions