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!)
A030446 Number of n-celled polyknights (polyominoes connected by knight's moves). 4
1, 1, 6, 35, 290, 2680, 26379, 267598, 2758016, 28749456, 302120154 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

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.

These are free polyknights.

LINKS

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

CROSSREFS

Cf. A030445, A030444, A030447, A030448.

Sequence in context: A187443 A087631 A167579 * A093989 A261073 A261080

Adjacent sequences:  A030443 A030444 A030445 * A030447 A030448 A030449

KEYWORD

nonn

AUTHOR

David W. Wilson

EXTENSIONS

Corrected and extended by Joseph Myers, May 21, 2004

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 5 11:36 EST 2016. Contains 278764 sequences.