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.

A274458 White to move: Number of up to 5 man GBR-codes on an 8x8 chessboard having longest checkmate under perfect play in n moves if any such checkmate exists.

Table of values

n a(n)
1 20
2 6
3 3
4 8
5 3
6 2
7 6
8 5
9 5
10 4
11 0
12 1
13 3
14 1
15 3
16 6
17 5
18 0
19 5
20 3
21 6
22 2
23 1
24 3
25 1
26 1
27 1
28 6
29 11
30 7
31 4
32 3
33 9
34 3
35 3
36 2
37 3
38 2
39 2
40 7
41 7
42 0
43 5
44 1
45 1
46 0
47 0
48 0
49 1
50 3
51 2
52 0
53 1
54 2
55 2
56 1
57 1
58 1
59 0
60 0
61 0
62 0
63 0
64 0
65 1
66 0
67 3
68 2
69 1
70 2
71 0
72 1
73 1
74 3
75 0
76 0
77 0
78 1
79 0
80 0
81 1
82 0
83 1
84 0
85 0
86 0
87 0
88 0
89 0
90 0
91 0
92 0
93 0
94 0
95 0
96 0
97 1
98 0
99 0
100 1
101 0
102 0
103 1
104 2
105 1
106 0
107 1
108 0
109 0
110 0
111 0
112 0
113 0
114 0
115 1
116 0
117 0
118 0
119 0
120 0
121 0
122 0
123 0
124 2
125 0
126 0
127 1

List of values

[20, 6, 3, 8, 3, 2, 6, 5, 5, 4, 0, 1, 3, 1, 3, 6, 5, 0, 5, 3, 6, 2, 1, 3, 1, 1, 1, 6, 11, 7, 4, 3, 9, 3, 3, 2, 3, 2, 2, 7, 7, 0, 5, 1, 1, 0, 0, 0, 1, 3, 2, 0, 1, 2, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 3, 2, 1, 2, 0, 1, 1, 3, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 2, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 1]