|
%I #14 Mar 03 2018 17:36:03
%S 1,18,159,1586,15731,157085,1570800,15707976
%N Number of steps of iterating 0 under z^2 + c before escaping, i.e., abs(z^2 + c) > 2, with c = -5/4 - epsilon^2 + epsilon*i, where epsilon = 10^(-n) and i^2 = -1.
%C A relation between Pi and the Mandelbrot set: 2*a(n)*epsilon converges to Pi.
%C c = -5/4 - epsilon^2 + epsilon*i is a parabolic route into the point c = -5/4, the second neck of the Mandelbrot set.
%C The difference between the terms of a(n) and A300077(n) = floor(1/2*Pi*10^n) is d(n) = 0, 3, 2, 16, 24, 6, 4, 13, ...
%H Gerald Edgar, <a href="https://people.math.osu.edu/edgar.2/piand.html">Pi and the Mandelbrot set.</a> (The Ohio State University.)
%H Boris Gourévitch, <a href="http://www.pi314.net/eng/mandelbrot.php">Pi and fractal sets. The Mandelbrot set -- Dave Boll -- Gerald Edgar.</a> (The World of Pi.)
%H Aaron Klebanoff, <a href="https://pdfs.semanticscholar.org/dbed/13dae724fed20356b81be91c63fc13b1e1b8.pdf">Pi in the Mandelbrot Set.</a> In: Fractals 9 (2001), nr. 4, p. 393-402.
%p Digits:=2^8:
%p f:=proc(z, c, k) option remember;
%p f(z, c, k-1)^2+c;
%p end;
%p a:=proc(n)
%p local epsilon, c, k;
%p epsilon:=10.^(-n):
%p c:=-1.25-epsilon^2+epsilon*I:
%p f(0, c, 0):=0:
%p for k do
%p if abs(f(0, c, k))>2 then
%p break;
%p fi;
%p od:
%p return(k);
%p end;
%p seq(a(n), n=0..7);
%o (Python)
%o from fractions import Fraction
%o def A300078(n):
%o zr, zc, c = Fraction(0,1), Fraction(0,1), 0
%o cr, cc = Fraction(-5,4)-Fraction(1,10**(2*n)), Fraction(1,10**n)
%o zr2, zc2 = zr**2, zc**2
%o while zr2 + zc2 <= 4:
%o zr, zc = zr2 - zc2 + cr, 2*zr*zc + cc
%o zr2, zc2 = zr**2, zc**2
%o c += 1
%o return c # _Chai Wah Wu_, Mar 03 2018
%Y Cf. A097486, A299415, A300077.
%K nonn,more
%O 0,2
%A _Martin Renner_, Feb 24 2018
|
