login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030444 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)