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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A196813 Number of ways to place 3 nonattacking nightriders on an n X n toroidal board 2
0, 0, 6, 96, 600, 1392, 2156, 10624, 22410, 62400, 82280, 210336, 280540, 495488, 955950, 1332736, 1844976, 2924640, 3933456, 6319200, 7954170, 10648000, 14081980, 19826304, 25502500, 31809856, 41037354, 52338272, 63979916, 84001200, 98348740, 123033600 (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, 4th edition p.195

Vaclav Kotesovec, Generating function and explicit formula

CROSSREFS

Cf. A173429, A196811

Sequence in context: A116256 A275086 A222971 * A179058 A303212 A226549

Adjacent sequences:  A196810 A196811 A196812 * A196814 A196815 A196816

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 August 20 01:14 EDT 2019. Contains 326136 sequences. (Running on oeis4.)