This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A119352 Smallest base b > 1 such that n in base b uses no digit b-1. 4
 2, 3, 4, 3, 3, 4, 4, 5, 4, 3, 3, 5, 3, 3, 6, 5, 4, 4, 4, 6, 4, 4, 4, 7, 4, 4, 4, 3, 3, 7, 3, 3, 4, 4, 4, 5, 3, 3, 4, 3, 3, 4, 4, 5, 6, 6, 6, 9, 6, 6, 5, 5, 5, 5, 6, 5, 5, 5, 5, 7, 5, 5, 5, 5, 4, 4, 4, 5, 4, 4, 4, 7, 4, 4, 4, 5, 5, 5, 5, 6, 4, 3, 3, 5, 3, 3, 4, 5, 4, 4, 3, 3, 5, 3, 3, 9, 4, 4, 4, 6, 4, 4, 4, 7, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 FORMULA 7 is 111_2 (has 1), 21_3 (has 2), 13_4 (has 3), but 12_5 (no 4), so a(7)=5. PROG (Haskell) a119352 n = f 2 n where    f b x = g x where      g 0 = b      g z = if r == b - 1 then f (b + 1) n else g z'            where (z', r) = divMod z b -- Reinhard Zumkeller, Apr 12 2015 CROSSREFS Cf. A119353, A119354, A106370. Sequence in context: A274007 A065870 A123699 * A205010 A204932 A079086 Adjacent sequences:  A119349 A119350 A119351 * A119353 A119354 A119355 KEYWORD base,nonn AUTHOR Franklin T. Adams-Watters, May 15 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.