Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020666
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020666 a(n)^n is the least n-th power containing every digit. +0
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; listen)
OFFSET

1,1

COMMENT

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

CROSSREFS

Cf. A020667.

Sequence in context: A096213 A048939 A095733 this_sequence A074205 A061604 A050278

Adjacent sequences: A020663 A020664 A020665 this_sequence A020667 A020668 A020669

KEYWORD

nonn,base

AUTHOR

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

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research