|
| |
|
|
A068953
|
|
Number of bases B (2 <= B <= n) such that every digit of n in base B is 0 or 1.
|
|
4
| |
|
|
0, 1, 2, 3, 3, 3, 3, 3, 4, 4, 3, 4, 4, 3, 3, 4, 4, 3, 3, 4, 4, 3, 3, 3, 4, 4, 4, 4, 3, 5, 5, 3, 3, 3, 3, 5, 5, 3, 4, 4, 3, 4, 4, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 5, 5, 3, 3, 4, 4, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 4, 6, 5, 3, 5, 5, 3, 3, 3, 3, 5, 5, 3, 4, 4, 3, 3, 3, 3, 3, 4, 4, 3, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
EXAMPLE
| a(30)=5, since 30 written in the 5 bases 2, 3, 5, 29, 30 is 11110, 1010, 110, 11, 10.
|
|
|
MATHEMATICA
| a[1]=0; a[n_] := Length[Select[Rest[Union[Divisors[n], Divisors[n-1]]], Max@@IntegerDigits[n, # ]==1&]]
|
|
|
CROSSREFS
| Cf. A059972.
Sequence in context: A025784 A035390 A092938 * A189635 A109785 A058224
Adjacent sequences: A068950 A068951 A068952 * A068954 A068955 A068956
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Dean Hickerson (dean.hickerson(AT)yahoo.com), Mar 31 2002
|
| |
|
|
