This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A068953 #18 Jul 04 2018 15:12:41
%S A068953 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,
%T A068953 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,
%U A068953 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
%N A068953 Number of bases B (2 <= B <= n) such that every digit of n in base B is 0 or 1.
%C A068953 All such bases are divisors of n or n-1, since the lowest base-B digit of n is 0 iff B | n, 1 iff B | n-1. - _Robert Israel_, Jul 04 2018
%H A068953 Robert Israel, <a href="/A068953/b068953.txt">Table of n, a(n) for n = 1..10000</a>
%e A068953 a(30)=5, since 30 written in the 5 bases 2, 3, 5, 29, 30 is 11110, 1010, 110, 11, 10.
%p A068953 f:= n ->
%p A068953 nops(select(b -> convert(convert(n,base,b),set) subset {0,1}, {$2..n} intersect (numtheory:-divisors(n) union numtheory:-divisors(n-1)))):
%p A068953 map(f, [$1..200]); # _Robert Israel_, Jul 04 2018
%t A068953 a[1]=0; a[n_] := Length[Select[Rest[Union[Divisors[n], Divisors[n-1]]], Max@@IntegerDigits[n, # ]==1&]]
%o A068953 (PARI) a(n) = sum(b=2, n, #select(x->(x>1), digits(n, b)) == 0); \\ _Michel Marcus_, Jul 04 2018
%Y A068953 Cf. A059972.
%K A068953 nonn,base
%O A068953 1,3
%A A068953 _Dean Hickerson_, Mar 31 2002