The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A251530 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A251530

Number of ways to place any number of black and any number of white nonattacking knights on a (n+2) X (5+2) board.
(history; published version)

#6 by Wesley Ivan Hurt at Fri Mar 25 18:52:20 EDT 2022

STATUS

editing

approved

#5 by Wesley Ivan Hurt at Fri Mar 25 18:51:45 EDT 2022

NAME

Number of ways to place any number of black and any number of white nonattacking knights on a (n+2) X (5+2) board.

COMMENTS

Column 5 of A251531.

CROSSREFS

Cf. A251531.

STATUS

approved

editing

#4 by R. H. Hardin at Thu Dec 04 12:03:09 EST 2014

STATUS

editing

approved

#3 by R. H. Hardin at Thu Dec 04 12:03:06 EST 2014

LINKS

R. H. Hardin, <a href="/A251530/b251530.txt">Table of n, a(n) for n = 1..11</a>

#2 by R. H. Hardin at Thu Dec 04 12:02:51 EST 2014

NAME

allocated for R. H. Hardin

Number of ways to place any number of black and any number of white nonattacking knights on a (n+2)X(5+2) board

DATA

31361437, 4060878845, 629694824303, 85453027245665, 11726484486571601, 1671396405843418205, 239415740786170785059, 34268623489221568471683, 4926792732223129880488261, 710174571545415147604020125

OFFSET

1,1

COMMENTS

Column 5 of A251531

EXAMPLE

Some solutions for n=1

..0..0..0..1..1..0..0....0..0..0..0..0..0..2....0..0..0..0..0..0..2

..0..0..0..0..0..0..1....0..0..0..2..2..2..1....0..0..0..1..0..0..2

..0..0..0..0..1..0..0....0..0..0..2..1..0..0....0..0..2..2..2..0..0

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Dec 04 2014

STATUS

approved

editing

#1 by R. H. Hardin at Thu Dec 04 11:57:18 EST 2014

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved