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

%I

%S 0,0,6,96,600,1392,2156,10624,22410,62400,82280,210336,280540,495488,

%T 955950,1332736,1844976,2924640,3933456,6319200,7954170,10648000,

%U 14081980,19826304,25502500,31809856,41037354,52338272,63979916,84001200,98348740,123033600

%N Number of ways to place 3 nonattacking nightriders on an n X n toroidal board

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

%H V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 4th edition p.195

%H Vaclav Kotesovec, <a href="/A196813/a196813.txt">Generating function and explicit formula</a>

%Y Cf. A173429, A196811

%K nonn

%O 1,3

%A _Vaclav Kotesovec_, Oct 06 2011

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 October 22 08:00 EDT 2019. Contains 328315 sequences. (Running on oeis4.)