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.

A277471 Normalized values of the Fabius function: 2^binomial(n-1, 2) * (2*n)! * A005329(n) * F(1/2^n).

Original entry on oeis.org

2, 1, 5, 105, 7007, 1298745, 619247475, 723733375365, 2006532782969715, 12889909959143502285, 188494585656727188486375, 6188497678605937441851529425, 451101946262511157576785806552415, 72341127537387548941434093006996374625, 25326487488712595887856341442148826764706875
Offset: 0

Views

Author

Vladimir Reshetnikov, Oct 16 2016

Keywords

Comments

The Fabius function F(x) is the smooth monotone increasing function on [0, 1] satisfying F(0) = 0, F(1) = 1, F'(x) = 2*F(2*x) for 0 < x < 1/2, F'(x) = 2*F(2*(1-x)) for 1/2 < x < 1. It is infinitely differentiable at every point in the interval, but is nowhere analytic. It assumes rational values at dyadic rationals.
Comment from Vladimir Reshetnikov, Jan 25 2017: I just realized that I do not have a rigorous proof that all terms are integers. Could somebody suggest a proof? I would also be very interested to learn the asymptotics of this sequence.
Juan Arias de Reyna proved that all terms are indeed integers. - Vladimir Reshetnikov, Feb 28 2017

References

  • Rvachev V. L., Rvachev V. A., Non-classical methods of the approximation theory in boundary value problems, Naukova Dumka, Kiev (1979) (in Russian), pages 117-125.

Crossrefs

Programs

  • Mathematica
    c[0] = 1; c[n_] := c[n] = Sum[(-1)^k c[n - k]/(2 k + 1)!, {k, 1, n}] / (4^n - 1); Table[2^(1 - 2 n) (2 n)! QFactorial[n, 2] Sum[c[k] (-1)^k/(n - 2 k)!, {k, 0, n/2}], {n, 0, 15}]

Formula

a(n) = 2^binomial(n-1, 2) * (2*n)! * A005329(n) * A272755(n) / A272757(n).