cp's OEIS Frontend

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.

A317413 Continued fraction for binary expansion of Liouville's number interpreted in base 2 (A092874).

This page as a plain text file.
%I A317413 #58 Dec 13 2024 18:09:10
%S A317413 0,1,3,3,1,2,1,4095,3,1,3,3,1,4722366482869645213695,4,3,1,3,4095,1,2,
%T A317413 1,3,3,1
%N A317413 Continued fraction for binary expansion of Liouville's number interpreted in base 2 (A092874).
%C A317413 The continued fraction of the number obtained by reading A012245 as binary fraction.
%C A317413 Except for the first term, the only values that occur in this sequence are 1, 2, 3, 4 and values 2^((m-1)*m!) - 1 for m > 2. The probability of occurrence P(a(n) = k) are given by:
%C A317413  P(a(n) = 1) = 1/3,
%C A317413  P(a(n) = 2) = 1/12,
%C A317413  P(a(n) = 3) = 1/3,
%C A317413  P(a(n) = 4) = 1/12 and
%C A317413  P(a(n) = 2^((m-1)*m!)-1) = 1/(3*2^(m-1)) for m > 2.
%C A317413 The next term is roughly 3.12174855*10^144 (see b-file for precise value).
%H A317413 A.H.M. Smeets, <a href="/A317413/b317413.txt">Table of n, a(n) for n = 0..48</a>
%F A317413 a(n) = 1 if and only if n in A317538.
%F A317413 a(n) = 2 if and only if n in {24*m - 19 | m > 0} union {24*m - 4 | m > 0}.
%F A317413 a(n) = 3 if and only if n in A317539.
%F A317413 a(n) = 4 if and only if n in {12*m + A014710(m-1) - 2*(A014710(m-1) mod 2) | m > 0}
%F A317413 a(n) = 2^((m-1)*m!)-1 if and only if n in {3*2^(m-2)*(1+k*4) + 1 | k >= 0} union {3*2^(m-2)*(3+k*4) | k >= 0} for m > 2.
%e A317413 0.76562505... = 0+1/(1+1/(3+1/(3+1/(1+1/(2+...))))). - _R. J. Mathar_, Jun 19 2021
%p A317413 with(numtheory): cfrac(add(1/2^factorial(n),n=1..7),24,'quotients'); # _Muniru A Asiru_, Aug 11 2018
%t A317413 ContinuedFraction[ FromDigits[ RealDigits[ Sum[1/10^n!, {n, 8}], 10, 10000], 2], 60] (* _Robert G. Wilson v_, Aug 09 2018 *)
%o A317413 (Python)
%o A317413 n,f,i,p,q,base = 1,1,0,0,1,2
%o A317413 while i < 100000:
%o A317413     i,p,q = i+1,p*base,q*base
%o A317413     if i == f:
%o A317413         p,n = p+1,n+1
%o A317413         f = f*n
%o A317413 n,a,j = 0,0,0
%o A317413 while p%q > 0:
%o A317413     a,f,p,q = a+1,p//q,q,p%q
%o A317413     print(a-1,f)
%Y A317413 Cf. A012245, A014710, A317538, A317539.
%Y A317413 Cf. A058304 (in base 10), A317414 (in base 3).
%K A317413 nonn,base,cofr
%O A317413 0,3
%A A317413 _A.H.M. Smeets_, Jul 27 2018