Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072075
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072075 Smallest solution to EulerPhi[x]=10^n. +0
1
11, 101, 1111, 10291, 113201, 1004251, 10165751, 100064101, 1000078501, 10000222501 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=Min{x; A000010[x]=10^n}

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.

Sequence in context: A006943 A073030 A097649 this_sequence A088292 A135563 A052075

Adjacent sequences: A072072 A072073 A072074 this_sequence A072076 A072077 A072078

KEYWORD

more,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 13 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research