ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let bm(n)b_m(n) denote the Bernoulli partition entries described in the preceding discussion, and let B2mB_{2m} be the Bernoulli numbers. For each column index n≥2n\geq 2, define the asymptotic ratio a(n)a(n) by

bm(n)∣B2m∣∼m→∞a(n).\frac{b_m(n)}{|B_{2m}|}\underset{m\rightarrow\infty}{\sim}a(n).

Let ⌊⋅⌋\lfloor\cdot\rfloor denote the floor function, and let Γ\Gamma denote the gamma function. Polynomial formula for the asymptotic ratios. The asymptotic ratios are a(n)=pn(π2)a(n)=p_n(\pi^2) for n≥2n\geq2, where pn(x)p_n(x) is the polynomial

pn(x)=14n2−1∑k=0⌊n/2⌋−1(−4)kxk+1(2k+1)!Γ(n−1)Γ(2n−2−2k)Γ(n−1−2k)Γ(2n−2).p_n(x)=\frac{1}{4n^2-1}\sum_{k=0}^{\left\lfloor n/2\right\rfloor-1}\frac{(-4)^k x^{k+1}}{(2k+1)!}\frac{\Gamma(n-1)\Gamma(2n-2-2k)}{\Gamma(n-1-2k)\Gamma(2n-2)}.

The formula is significant because it gives an explicit expression for the limiting growth ratios of the Bernoulli partition entries in terms of polynomials evaluated at π2\pi^2; the source presents it as a consequence of numerical calculations and OEIS data, with no resolution evidence supplied.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.