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.

A331814 Fourier coefficients of the boundary of the Mandelbrot set (normalized by a power of two).

Original entry on oeis.org

-1, 1, -8, 15, 0, -94, -512, 987, 0, -7346, 65536, -122058, 0, -2757820, -22020096, 59250963, 0, -329425898, 2617245696, -4805611678, -34359738368, -19403249316, 498216206336, -36302282082, 0, 14136557849100, -71399536328704, -88183884706356
Offset: 0

Views

Author

David A. Madore, Jan 27 2020

Keywords

Comments

a(n) = 2^(2*n+1)*b(n) where b(n) is the unique sequence of complex numbers such that f(z) := z + Sum_{n>=0} (b(n)*z^-n) defines an analytic homeomorphism (biholomorphic bijection) between the complement of the unit disk and the complement of the Mandelbrot set, sometimes known as the "Jungreis function". (The b(n) are rationals, so we multiply them by the appropriate power of two to make them integers; this is equivalent to a simple rescaling of the complex plane.) It is conjectured that |b(n)| <= 1/n, so |a(n)| <= 2^(2*n+1)/n.
Note that the table given in Ewing and Schober (1992) gives the coefficients of the inverse series (contrary to what the text itself says): it's not wrong, it's just mislabeled.

Examples

			a(0)=-1 because B(1,1)=0 and B(0,1) = 8*B(1,1) - 2*B(0,0) = -1; then a(1)=1 because B(1,2)=0 and B(0,2) = 8*B(1,2) - B(0,1)^2 - 2*B(0,1) = 1.
		

Formula

a(m)=B(0,m+1) where B(0,0)=1/2 and by downwards induction on k we have B(k-1,m) = 2^(2^(k+1)-1)*B(k,m) - 2^(2^(k+1)-4)*Sum_{j=2^k-1..m-2^k+1} (B(k-1,j)*B(k-1,m-j) - 2*B(0,m-2^k+1)) if m >= 2^k-1, 0 otherwise.