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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A278688 Triangle read by rows T(n, k) = number of non-equivalent ways to place k non-attacking ferses on an n X n board. 7
1, 1, 1, 1, 1, 1, 3, 6, 7, 6, 2, 1, 1, 3, 17, 45, 92, 99, 76, 27, 7, 1, 6, 43, 225, 832, 2102, 3773, 4860, 4643, 3356, 1868, 795, 248, 56, 8, 1, 1, 6, 84, 709, 4500, 19987, 66201, 164423, 314224, 465230, 540247, 492206, 352300, 195717, 83247, 26083, 5754, 780, 55 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

COMMENTS

The triangle T(n, k) is irregularly shaped: 0 <= k <= A093005(n), which means that A093005(n) is the maximal number of non-attacking ferses that can be placed on an n X n board. First row corresponds to n = 1. First column corresponds to k = 0.

Two placements that differ by rotation or reflection are counted only once.

A fers is a fairy chess piece attacking one step ne-nw-sw-se.

LINKS

Heinrich Ludwig, Table of n, a(n) for n = 1..130

Wikipedia, Fairy chess piece

EXAMPLE

Triangle begins:

1, 1;

1, 1,  1;

1, 3,  6,  7,  6,  2,  1;

1, 3, 17, 45, 92, 99, 76, 27, 7;

CROSSREFS

Cf. A008805, A232567, A278682, A278683, A278684, A278685, A278686, (columns 2 through 8 of this sequence, respectively), A278687, A093005 (row length - 1).

Sequence in context: A245220 A165952 A156648 * A016616 A256936 A021276

Adjacent sequences:  A278685 A278686 A278687 * A278689 A278690 A278691

KEYWORD

nonn,tabf

AUTHOR

Heinrich Ludwig, Nov 27 2016

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 12:38 EST 2018. Contains 317351 sequences. (Running on oeis4.)