|
%I #50 Apr 25 2021 10:42:49
%S 1,1,2,7,286,144305,276620298878,4929053594885296570083,
%T 2778177345800469611391891486368048702791639566906088871615186
%N Numerators of the sequence 1, 1/2, (1/2)/(3/4), ((1/2)/(3/4))/((5/6)/(7/8)), ... .
%C The sequence of fractions f(n) tends to 1/sqrt(2).
%C Factors of numerators before cancellation (1,1,4,6,7,10,11,13,16,18,19,...) coincide with A026147 (for n>0).
%C Factors of denominators before cancellation (1,2,3,5,8,9,12,14,15,17,...) coincide with A181155 (for n>0).
%D Jean-Paul Allouche and Jeffrey Shallit, The Ubiquitous Prouhet-Thue-Morse Sequence, in C. Ding, T. Helleseth, N. Niederreiter (eds.), Sequences and their Applications: Proceedings of SETA '98, Springer-Verlag, London, 1999, pp. 1-16.
%D Michael Trott, Exercises of The Mathematica GuideBook for Numerics, Chapter 2, p. 33.
%H Alois P. Heinz, <a href="/A290637/b290637.txt">Table of n, a(n) for n = 0..12</a>
%H Michael Trott, <a href="http://www.mathematicaguidebooks.org/scripts/software.cgi?software_download=Sample_Exercises_Numerics.nb.pdf">Mathematica Guidebooks</a>, Sample Exercises Numerics p. 33.
%H Donald R. Woods, David Robbins and Gustaf Gripenberg, <a href="http://www.jstor.org/stable/2321105">Solution to Problem E2692</a>, American Mathematical Monthly, Vol. 86, No. 5 (May 1979), pp. 394-395.
%F f(n) = Product_{k=0..2^(n-1)-1} ((2k+1)/(2k+2))^((-1)^tm(k)), where tm(k) is the Thue-Morse sequence A010060.
%e f(3): 1*4*6*7/(2*3*5*8) = 7/10, hence a(3) = 7.
%e f(5): 1*4*6*7*10*11*13*16*18*19*21*24*25*28*30*31 / (2*3*5*8*9*12*14*15*17*20*22*23*26*27*29*32) = 144305 / 204102 = 0.707024..., hence a(5) = 144305.
%e Sequence of fractions f(n) begin: 1/1, 1/2, 2/3, 7/10, 286/405, 144305/204102, ...
%p g:= (i, j)-> `if`(j=0, i, g(i, j-1)/g(i+2^(j-1), j-1)):
%p a:= n-> numer(g(1, n)):
%p seq(a(n), n=0..10); # _Alois P. Heinz_, Aug 08 2017
%t f[1] = id[1]/id[2]; f[n_] := f[n] = f[n-1]/(f[n-1] /. id[k_] :> id[k + 2^(n-1)]); a[n_]:= f[n] /. id -> Identity // Numerator; Array[a,8]
%o (Python)
%o from sympy.core.cache import cacheit
%o from sympy import numer, Rational
%o @cacheit
%o def g(i, j): return Rational(i) if j==0 else g(i, j - 1)/g(i + 2**(j - 1), j - 1)
%o def a(n): return numer(g(1, n))
%o print([a(n) for n in range(11)]) # _Indranil Ghosh_, Aug 09 2017, after Maple code
%Y Cf. A010060, A026147, A094541 (supersequence of numerators), A094542 (supersequence of denominators), A181155, A290638 (denominators).
%K nonn,frac
%O 0,3
%A _Jean-François Alcover_, Aug 08 2017
|
