Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061604
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A061604
%S A061604 1023456789,1023456798,1023456789,1023457896,1023467895,1023456798,
%T A061604 1023456798,1023457896,1023456789,1234567890,1024375869,1023457896,
%U A061604 1023456798,1023456798,1023467895,1023457968,1023457698,1023456798
%N A061604 Smallest multiple of n containing all 10 digits from 0 to 9.
%C A061604 It can be shown that for every positive integer there exist infinitely 
               many multiples containing all the 10 digits.
%Y A061604 Sequence in context: A095733 A020666 A074205 this_sequence A050278 A051018 
               A020667
%Y A061604 Adjacent sequences: A061601 A061602 A061603 this_sequence A061605 A061606 
               A061607
%K A061604 nonn,base,easy
%O A061604 1,1
%A A061604 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 19 2001
%E A061604 Corrected and extended by Patrick De Geest (pdg(AT)worldofnumbers.com), 
               Jun 04 2001.

    
page 1

Search completed in 0.001 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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research