Rob Pratt's generating-function conjecture for the packing number of the double vertex graph of a path

Let A085680(n)A085680(n) denote the packing number of the double vertex graph of the path graph PnP_n, equivalently ρ(F2(Pn))\rho(F_2(P_n)), where F2(Pn)F_2(P_n) is the 2-token graph of PnP_n. Rob Pratt's conjecture asserts

n0A085680(n+2)xn=1x+x2x10+x11(1x)2(1x5).\sum_{n\geq 0} A085680(n+2)x^n=\frac{1-x+x^2-x^{10}+x^{11}}{(1-x)^2(1-x^5)}.

This conjecture gives the ordinary generating function for the sequence whose exact values were known up to n=50n=50 at the time it was posed; the supplied source does not indicate whether the conjecture has since been resolved.

Sources & referencesView supporting material

Primary source

José Manuel Gómez Soto, Jesús Leaños, Luis Manuel Ríos-Castro and Luis Manuel Rivera, “The packing number of the double vertex graph of the path graph”, arXiv:1711.03682 (2018).

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.