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!)
A020667 Least n-th power containing every digit. 2
1023456789, 1026753849, 12584301976, 338920744561, 2817036000549, 16157819263041, 1727094849536, 13685690504052736, 1628413597910449, 3656158440062976, 2384185791015625, 129746337890625, 1490116119384765625, 168377826559400929, 2862423051509815793 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
It is extremely probable that a(n) = 2^n for all n >= 169.
LINKS
PROG
(Python)
def a(n):
if n == 1: return 1023456789
a020667n = 2
while not(len(set(str(a020667n**n))) == 10): a020667n += 1
return a020667n**n
print([a(n) for n in range(1, 16)]) # Michael S. Branicky, Jul 04 2021
CROSSREFS
Sequence in context: A171102 A050278 A051018 * A154566 A217535 A180489
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 29 07:27 EDT 2024. Contains 371265 sequences. (Running on oeis4.)