%I #16 Jan 18 2023 09:36:15
%S 0,1,0,1,1,4,7,31,95,420,1682,7544,33288,152022,696096,3231001
%N Number of free (2-sided) ouroboros polyominoes with k=2n cells.
%C A "snake" polyomino is a polyomino in which exactly two cells have exactly one (Von Neumann) neighbor apiece, and the rest have two neighbors apiece. Arthur O'Dwyer coined the term "ouroboros polyomino" for a polyomino in which every cell has exactly two neighbors: that is, an ouroboros polyomino is like a "snake" in which the head cell neighbors the tail cell.
%C A324407 etc. use the term "polyomino ring" in place of "ouroboros polyomino."
%C A checkerboard coloring shows that every ouroboros must have an even number of cells.
%C This sequence counts ouroboroi which do not designate a specific head or tail cell; thus the unique 8-cell ouroboros is
%C ###
%C # #
%C ###
%C One could imagine counting "headed" ouroboroi, in which the head and tail are distinguished. There are two distinct ways to create a free 8-cell "headed" ouroboros:
%C ##H #HT
%C # T # #
%C ### ###
%C This sequence first differs from A359707 (the count of 1-sided ouroboroi) at k=14. The four chiral 14-cell ouroboroi, each of which is counted once by A359706 and twice by A359707, are
%C ### #### ### ###
%C # # # ## # # # ##
%C # ## ## # # ## # #
%C # # #### ## # # #
%C #### ### ####
%H Arthur O'Dwyer, <a href="https://quuxplusone.github.io/blog/2022/12/08/polyomino-snakes/">Polyomino strips, snakes, and ouroboroi</a> (gives the first 32 terms)
%H Arthur O'Dwyer, <a href="https://quuxplusone.github.io/blog/code/2022-12-08-polyomino-snakes-and-strips.cpp">C++ program</a>
%o (C++) // see Links section
%Y A002013 counts free (2-sided) snake polyominoes with k=n cells. A359706 added to A002013 gives the number of free polyominoes in which each cell has at most 2 (Von Neumann) neighbors.
%Y A359707 counts free (2-sided) ouroboros polyominoes with k=2n cells. A359706 subtracted from A359707 gives the count of chiral pairs.
%K nonn,more
%O 1,6
%A _Arthur O'Dwyer_, Jan 11 2023