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.

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

Original entry on oeis.org

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

Views

Author

Labos Elemer, Jun 13 2002

Keywords

Examples

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

Crossrefs

Extensions

More terms from Max Alekseyev, Apr 26 2010
a(18)-a(19) from Donovan Johnson, Feb 02 2012