login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030444 Number of fixed n-celled polyknights. 9
1, 4, 28, 234, 2162, 20972, 209608, 2135572, 22049959, 229939414, 2416816416, 25569786440 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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.

REFERENCES

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.

LINKS

Table of n, a(n) for n=1..12.

CROSSREFS

Cf. A030445, A030446, A030447, A030448.

Sequence in context: A229645 A202824 A046904 * A093877 A151830 A112113

Adjacent sequences:  A030441 A030442 A030443 * A030445 A030446 A030447

KEYWORD

nonn

AUTHOR

David W. Wilson

EXTENSIONS

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

12th term by Gill Barequet, May 24 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 12:25 EST 2016. Contains 278971 sequences.