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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A196811 Number of ways to place 3 nonattacking nightriders on an n X n cylindrical board 3
0, 0, 6, 144, 600, 1992, 4592, 15616, 31788, 74840, 122210, 251184, 384826, 647696, 1085190, 1616384, 2308872, 3449880, 4783326, 7052400, 9253734, 12454640, 16453096, 22180992, 28552450, 36216544, 46089162, 58449104, 72061346, 91140000, 109813780, 135448576 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

A nightrider is a fairy chess piece that can move (proportionate to how a knight moves) in any direction.

LINKS

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

V. Kotesovec, Non-attacking chess pieces

Vaclav Kotesovec, Generating function and explicit formula

CROSSREFS

Cf. A173429, A196813

Sequence in context: A277419 A111839 A037049 * A200457 A128785 A197178

Adjacent sequences:  A196808 A196809 A196810 * A196812 A196813 A196814

KEYWORD

nonn

AUTHOR

Vaclav Kotesovec, Oct 06 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 12:42 EDT 2019. Contains 327307 sequences. (Running on oeis4.)