The first-column inverse-matrix partition-function conjecture

Let p(n)p(n) denote the partition function, let μ(n)\mu(n) denote the Möbius function, and let sn,1(1)s_{n,1}^{(-1)} denote the entries in the first column of the inverse matrix under consideration. First-column inverse-matrix conjecture. The first column is given by the convolution

sn,1(1)=dnp(d1)μ(n/d).s_{n,1}^{(-1)}=\sum_{d\mid n}p(d-1)\mu(n/d).

Equivalently, Möbius inversion gives

p(n1)=dnsd,1(1).p(n-1)=\sum_{d\mid n}s_{d,1}^{(-1)}.

The source presents this as an experimental conjecture based on the observed initial values and an OEIS match; no proof or resolution is supplied.

Sources & referencesView supporting material

Primary source

Mircea Merca and Maxie D. Schmidt, “Generating Special Arithmetic Functions by Lambert Series Factorizations”, arXiv:1706.00393 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.