Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020667
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A020667
%S A020667 1023456789,1026753849,12584301976,338920744561,2817036000549,
%T A020667 16157819263041,1727094849536,13685690504052736,1628413597910449,
%U A020667 3656158440062976,2384185791015625,129746337890625,1490116119384765625
%N A020667 Least n-th power containing every digit.
%C A020667 It is extremely probable that a(n) = 2^n for all n >= 169.
%Y A020667 Cf. A020666.
%Y A020667 Sequence in context: A061604 A050278 A051018 this_sequence A154566 A051264 
               A036745
%Y A020667 Adjacent sequences: A020664 A020665 A020666 this_sequence A020668 A020669 
               A020670
%K A020667 nonn,base
%O A020667 1,1
%A A020667 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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research