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.

A378561 Number of ways to place k nonattacking anassas on an n X n chess board. Triangle T(n,k) read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 4
5 3
6 1
7 9
8 22
9 14
10 1
11 16
12 82
13 156
14 90
15 1
16 25
17 220
18 840
19 1366
20 738
21 1
22 36
23 485
24 3100
25 9796
26 14288
27 7364
28 1
29 49
30 938
31 9030
32 46816
33 129360
34 174112
35 86608
36 1
37 64
38 1652
39 22344
40 172116
41 767424
42 1916776
43 2424880
44 1173240
45 1
46 81
47 2712
48 49056
49 525756
50 3442740
51 13682320
52 31572720
53 38019496
54 17990600

List of values

[1, 1, 1, 1, 4, 3, 1, 9, 22, 14, 1, 16, 82, 156, 90, 1, 25, 220, 840, 1366, 738, 1, 36, 485, 3100, 9796, 14288, 7364, 1, 49, 938, 9030, 46816, 129360, 174112, 86608, 1, 64, 1652, 22344, 172116, 767424, 1916776, 2424880, 1173240, 1, 81, 2712, 49056, 525756, 3442740, 13682320, 31572720, 38019496, 17990600]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.