TOPICS
Search

Binary Champernowne Constant


The "binary" Champernowne constant is obtained by concatenating the binary representations of the integers

C_2=0.(1)(10)(11)(100)(101)(110)(111)..._2
(1)
=0.86224012586805...
(2)

(OEIS A030190 and A066716). The sequence given by the first few concatenations is therefore 1, 110, 11011, 11011100, 11011100101, ... (OEIS A058935). C_2 can also be written

 C_2=sum_(n=1)^inftyn/(2^(F_n)),
(3)

with

 F_n=n+sum_(k=1)^n|_log_2k_|,
(4)

and |_x_| the floor function (Bailey and Crandall 2002). Interestingly, C_2 is 2-normal (Bailey and Crandall 2002).

C_2 has continued fraction [0, 1, 6, 3, 1, 6, 5, 3, 3, 1, 6, 4, 1, 3, 298, 1, 6, 1, 1, 3, 285, 7, 2, 4, 1, 2, 1, 2, 1, 1, 4534532, ...] (OEIS A066717), which exhibits sporadic large terms. The numbers of decimal digits in these terms are 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, ....


See also

Champernowne Constant, Ternary Champernowne Constant

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

References

Sloane, N. J. A. Sequences A030190, A066716, and A066717 in "The On-Line Encyclopedia of Integer Sequences."

Cite this as:

Weisstein, Eric W. "Binary Champernowne Constant." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/BinaryChampernowneConstant.html

Subject classifications