The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072075 Smallest solution to phi(x) = 10^n where phi(x) = A000010(x). 4
 1, 11, 101, 1111, 10291, 100651, 1004251, 10165751, 100064101, 1000078501, 10000222501, 100062501601, 1000062516001, 10000062660001, 100002441447211, 1003922328562757, 10000390625025601, 100000002482366251, 1000000002851006251, 10000062500000160001 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS 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 EXAMPLE n=3: a(3)=1111 because InvPhi[1000]= {1111,1255,1375,1875,2008,2222,2500,2510,2750,3012,3750}. CROSSREFS Cf. A000010, A014573, A014197, A110077, A072074, A072076. Sequence in context: A284479 A290661 A097649 * A290294 A289043 A289880 Adjacent sequences: A072072 A072073 A072074 * A072076 A072077 A072078 KEYWORD nonn AUTHOR Labos Elemer, Jun 13 2002 EXTENSIONS More terms from Max Alekseyev, Apr 26 2010 a(18)-a(19) from Donovan Johnson, Feb 02 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 1 07:16 EST 2023. Contains 359981 sequences. (Running on oeis4.)