Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030283
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A030283
%S A030283 0,1,2,3,4,5,6,7,8,9,10,22,30,41,50,61,70,81,90,111,200,311,400,511,600,
%T A030283 711,800,911,2000,3111,4000,5111,6000,7111,8000,9111,20000,31111,40000,
%U A030283 51111,60000,71111,80000,91111,200000,311111,400000,511111,600000
%N A030283 a(0) = 0; for n>0, a(n) is the smallest number which does not use any 
               digit used by a(n-1).
%C A030283 The sequence is infinite.
%t A030283 a = {0}; For[n = 1, n < 1000000, n++, If[Length[Intersection[IntegerDigits[n], 
               IntegerDigits[a[[ -1]]]]] == 0, AppendTo[a, n]]]; a - Stefan Steinerberger 
               (stefan.steinerberger(AT)gmail.com), May 30 2007
%Y A030283 Cf. A068860, A068861.
%Y A030283 Sequence in context: A132271 A116069 A081511 this_sequence A114806 A039229 
               A054659
%Y A030283 Adjacent sequences: A030280 A030281 A030282 this_sequence A030284 A030285 
               A030286
%K A030283 nonn,base,nice
%O A030283 0,3
%A A030283 Patrick De Geest (pdg(AT)worldofnumbers.com)
%E A030283 Edited by N. J. A. Sloane (njas(AT)research.att.com) at the suggestion 
               of Rick L. Shepherd, Sep 27 2007

    
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research