[seqfan] Number of knots with trivializing number k among all knots with n crossings

[Jonathan Post]

Number of knots with trivializing number k among all knots with n crossings.

derived from Table 1, p.24, of
Allison Henrich, Noel MacNaughton, Sneha Narayan, Oliver Pechenik,
Jennifer Townsend,
Classical and Virtual Pseudodiagram Theory and New Bounds on
Unknotting Numbers and Genus
http://arxiv.org/PS_cache/arxiv/pdf/0908/0908.1981v1.pdf

n / k=1.|.k=2.|.k=3.|.k=4.|.k=5.|.k=6.|.
n=3.|.0. |.1.|
n=4.|.0. |.1.|
n=5.|.0.|.0.|.0.|..1.|
n=6.|.0.|.1.|.0.|..2.|
n=7.|.0.|.1.|.0.|..5.|.0.|.6.|
n=8.|.0.|.1.|.0.|.11.|.0.|.9.|

The n=9 row of the table seems currently uncertain for some values of k.

Is this good for OEIS? Should one eliminate the non-even k columns,
per theorem in the paper? Is there a better presentation?

Thank you,

Jonathan Vos Post