%I #26 Dec 25 2018 11:01:27
%S 1,2,6,36,276,2936,35872,484088,6967942,105555336,1664142836
%N Knot diagrams with n crossings.
%C From _Andrey Zabolotskiy_, Dec 24 2018: (Start)
%C It follows from Definition 7 of the paper by Cantarella, Chapman & Mastin that every one of A008988(n) knot shadows contributes some diagrams to a(n). The number of diagrams contributed is shown near knot shadows in the illustration linked below (e.g., the knot shadow looking like an n-gon with petals contributes A000031(n) inequivalent diagrams, while non-symmetric knot shadows contribute 2^n diagrams each). Note that the orientation of knot shadows is not shown when it is not needed to distinguish two knot shadows, but all the knot shadows are oriented, which spoils the symmetry of many of them. (Even though the paper itself starts from unoriented knot shadows counted by A008989, eventually the orientation is assigned to the diagrams.)
%C The more symmetric a knot shadow is, the fewer inequivalent diagrams it contributes. The knot shadows and the diagrams generated by them are oriented but immersed into unoriented spheres. When determining equivalent diagrams, they can be rotated on the sphere and turned "inside out" but not reflected. Some planar drawings of knot shadows make them look less symmetric than they actually are (taking into account their immersion into the sphere).
%C Note that this equivalence relation distinguishes many more knot diagrams than the ambient isotopy of knots, cf. A086825. (End)
%H J. Cantarella, H. Chapman, M. Mastin, <a href="https://arxiv.org/abs/1512.05749">Knot Probabilities in Random Diagrams</a>, arXiv preprint arXiv:1512.05749 [math.GT], 2015. See Tables I and III.
%H Andrey Zabolotskiy, <a href="/A277740/a277740.png">Illustration of the knot shadows contributing to a(0)-a(4)</a>
%Y Cf. A000031, A008988, A008989, A086825, A277740.
%K nonn,more
%O 0,2
%A _N. J. A. Sloane_, Nov 07 2016
%E a(0)-a(2) from _Andrey Zabolotskiy_, Dec 24 2018