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!)
A030446 Number of n-celled polyknights (polyominoes connected by knight's moves). 6

%I #14 Jan 13 2023 06:32:53

%S 1,1,6,35,290,2680,26379,267598,2758016,28749456,302120154,3196299285,

%T 34007337629

%N Number of n-celled polyknights (polyominoes connected by knight's moves).

%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.

%C These are free polyknights.

%H John Mason, <a href="/A030446/a030446_1.pdf">Illustrations</a>

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

%K nonn,more

%O 1,3

%A _David W. Wilson_

%E Corrected and extended by _Joseph Myers_, May 21 2004

%E a(12)-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 25 12:28 EDT 2024. Contains 371969 sequences. (Running on oeis4.)