login
The OEIS is supported by the many generous donors 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. 5
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; text; internal format)
OFFSET
1,1
COMMENTS
It is extremely probable that a(n) = 2 for all n >= 169.
LINKS
PROG
(Python)
def a(n):
if n == 1: return 1023456789
an = 2
while not(len(set(str(an**n))) == 10): an += 1
return an
print([a(n) for n in range(1, 90)]) # Michael S. Branicky, Jul 04 2021
CROSSREFS
Sequence in context: A269120 A095733 A239919 * A074205 A277054 A218770
KEYWORD
nonn,base
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 02:58 EDT 2024. Contains 370952 sequences. (Running on oeis4.)