cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A196811 Number of ways to place 3 nonattacking nightriders on an n X n cylindrical board.

Original entry on oeis.org

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
Offset: 1

Views

Author

Vaclav Kotesovec, Oct 06 2011

Keywords

Comments

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

Crossrefs