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.

A376732 Triangle read by rows: T(n,k) is the maximum number of squares covered (i.e., attacked) by k independent (i.e., non-attacking) queens on an n X n chessboard.

Table of values

n a(n)
1 1
2 4
3 0
4 9
5 9
6 0
7 12
8 15
9 16
10 16
11 17
12 23
13 25
14 25
15 25
16 20
17 30
18 35
19 36
20 36
21 36
22 25
23 37
24 45
25 49
26 49
27 49
28 49
29 28
30 44
31 55
32 62
33 64
34 64
35 64
36 64
37 33
38 52
39 66
40 76
41 81
42 81
43 81
44 81
45 81
46 36
47 60
48 77
49 92
50 100
51 100
52 100
53 100
54 100
55 100
56 41
57 68
58 88
59 104
60 121
61 121
62 121
63 121
64 121
65 121
66 121

List of values

[1, 4, 0, 9, 9, 0, 12, 15, 16, 16, 17, 23, 25, 25, 25, 20, 30, 35, 36, 36, 36, 25, 37, 45, 49, 49, 49, 49, 28, 44, 55, 62, 64, 64, 64, 64, 33, 52, 66, 76, 81, 81, 81, 81, 81, 36, 60, 77, 92, 100, 100, 100, 100, 100, 100, 41, 68, 88, 104, 121, 121, 121, 121, 121, 121, 121]

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

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