login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020666 a(n)^n is the least n-th power containing every digit. 3
1023456789, 32043, 2326, 763, 309, 159, 56, 104, 49, 36, 25, 15, 25, 17, 17, 15, 16, 7, 5, 6, 6, 5, 11, 9, 14, 5, 5, 5, 5, 9, 5, 8, 11, 4, 4, 6, 5, 7, 3, 5, 4, 4, 6, 4, 3, 6, 3, 3, 4, 4, 5, 4, 3, 6, 4, 4, 3, 4, 4, 3, 3, 3, 3, 3, 3, 4, 3, 2, 3, 2, 3, 3, 3, 3, 4, 3, 3, 3, 2, 3, 4, 2, 3, 2, 3, 3, 2, 2, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

It is extremely probable that a(n) = 2 for all n >= 169.

CROSSREFS

Cf. A020667.

Sequence in context: A096213 A048939 A095733 * A074205 A204045 A061604

Adjacent sequences:  A020663 A020664 A020665 * A020667 A020668 A020669

KEYWORD

nonn,base

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 07:30 EST 2012. Contains 205998 sequences.