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.

A378590 Total number of ways to place k nonattacking bishops on an n X n chess board. Triangle T(n,k) read by rows (0 <= k <= 2*n-[n>0]-[n>1]).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 4
5 4
6 1
7 9
8 26
9 26
10 8
11 1
12 16
13 92
14 232
15 260
16 112
17 16
18 1
19 25
20 240
21 1124
22 2728
23 3368
24 1960
25 440
26 32
27 1
28 36
29 520
30 3896
31 16428
32 39680
33 53744
34 38368
35 12944
36 1600
37 64
38 1
39 49
40 994
41 10894
42 70792
43 282248
44 692320
45 1022320
46 867328
47 389312
48 81184
49 5792
50 128

List of values

[1, 1, 1, 1, 4, 4, 1, 9, 26, 26, 8, 1, 16, 92, 232, 260, 112, 16, 1, 25, 240, 1124, 2728, 3368, 1960, 440, 32, 1, 36, 520, 3896, 16428, 39680, 53744, 38368, 12944, 1600, 64, 1, 49, 994, 10894, 70792, 282248, 692320, 1022320, 867328, 389312, 81184, 5792, 128]