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.

Showing 1-1 of 1 results.

A182563 Number of ways to place n non-attacking semi-knights on an n x n chessboard.

Original entry on oeis.org

1, 6, 70, 1289, 33864, 1148760, 47700972, 2344465830, 133055587660, 8559364525414, 615266768106190, 48861588247978827, 4247584874013608724, 401107335066453376830, 40880928693752664368224, 4472281486633326131737868
Offset: 1

Views

Author

Vaclav Kotesovec, May 05 2012

Keywords

Comments

Semi-knight is a semi-leaper [1,2]. Moves of a semi-knight are allowed only in [2,1] and [-2,-1]. See also semi-bishops (A187235).

Crossrefs

Formula

Asymptotic: a(n) ~ n^(2n)/n!*exp(-3/2).

Extensions

a(16) from Vaclav Kotesovec, May 24 2021
Showing 1-1 of 1 results.