c=0.857282383103406177511903308509733997590988312093146922257824...
The number of 1's in the binary expansion of a(n) is given by
the partial quotients of continued fraction of log(2):
log(2) = [0; 1, 2, 3, 1, 6, 3, 1, 1, 2, 1, 1, 1, 1, 3, 10, ...]
as can be seen by the binary expansions of a(n):
a(0) = 0
a(1) = 2^0
a(2) = 2^2 + 2^1
a(3) = 2^7 + 2^4 + 2^1
a(4) = 2^3
a(5) = 2^75 + 2^62 + 2^49 + 2^36 + 2^23 + 2^10
a(6) = 2^189 + 2^101 + 2^13
a(7) = 2^88
a(8) = 2^277
a(9) = 2^1007 + 2^365
a(10) = 2^642
a(11) = 2^1649
a(12) = 2^2291
a(13) = 2^3940
a(14) = 2^26573 + 2^16402 + 2^6231
