login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of fixed n-celled polyknights.
9

%I #17 Jan 13 2023 05:40:01

%S 1,4,28,234,2162,20972,209608,2135572,22049959,229939414,2416816416,

%T 25569786440,272057195864

%N Number of fixed n-celled polyknights.

%C A polyknight is a variant of a polyomino in which two tiles a knight's move apart are considered adjacent. A polyknight need not be connected in the sense of a polyomino.

%D G. Aleksandrowicz and G. Barequet, Parallel enumeration of lattice animals, Proc. 5th Int. Frontiers of Algorithmics Workshop, Zhejiang, China, Lecture Notes in Computer Science, 6681, Springer-Verlag, 90-99, May 2011.

%Y Cf. A030445, A030446, A030447, A030448.

%K nonn,more

%O 1,2

%A _David W. Wilson_

%E Corrected and extended by Guenter Stertenbrink (Sterten(AT)aol.com), May 23 2004

%E 12th term from _Gill Barequet_, May 24 2011

%E a(13) from _John Mason_, Jan 13 2023