The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A033093 Number of 0's when n is written in base b for 2<=b<=n+1. 15
 0, 1, 1, 3, 2, 3, 1, 5, 5, 5, 3, 6, 2, 3, 3, 8, 5, 9, 5, 8, 5, 4, 2, 9, 5, 5, 7, 9, 5, 8, 2, 11, 9, 8, 8, 13, 6, 7, 6, 11, 5, 9, 3, 7, 8, 5, 3, 13, 7, 10, 8, 9, 5, 12, 7, 11, 6, 5, 3, 13, 3, 4, 6, 15, 12, 14, 8, 11, 9, 12, 6, 18, 8, 9, 11, 11, 9, 11, 5, 14, 13 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Grant Garcia, Table of n, a(n) for n=1..10000 FORMULA Conjecture: lim inf a(n) = infinity. The lim inf grows quite slowly: e.g. a(2047)=7. Weaker conjecture: 2, 3 and 7 are the only n for which a(n) = 1. Note that a(n)=1 implies n=2 or n=2^k-1; probabilistically, the chance that 2^k-1 has no zeros just in base 3 is C^k, where C = (2/3)^(log(2)/log(3)) ~ .774, so the number of exceptions should be finite. It appears that 2^15-1 is the last n with no zeros in either base 2 or 3 (and it does have zeros in base 5). - Franklin T. Adams-Watters, Nov 07 2005 G.f.: (Sum_{b>=2} (Sum_{k>=0} x^(b^(k+1))/(Sum_{0<=i

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

Last modified February 26 21:58 EST 2020. Contains 332295 sequences. (Running on oeis4.)