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.

A051756 Consider the problem of placing N queens on an n X n board so that each queen attacks precisely 3 others. Sequence gives maximal number of queens.

Table of values

n a(n)
2 4
3 6
4 8
5 10
6 12
7 16
8 18
9 20
10 22
11 24
12 28
13 30
14 32
15 34
16 36
17 40
18 42
19 44
20 46
21 48
22 52
23 54
24 56
25 58
26 60
27 64
28 66
29 68
30 70
31 72
32 76
33 78
34 80
35 82
36 84
37 88
38 90
39 92
40 94
41 96
42 100
43 102
44 104
45 106
46 108
47 112
48 114
49 116
50 118
51 120
52 124
53 126
54 128
55 130
56 132
57 136
58 138
59 140
60 142
61 144

List of values

[4, 6, 8, 10, 12, 16, 18, 20, 22, 24, 28, 30, 32, 34, 36, 40, 42, 44, 46, 48, 52, 54, 56, 58, 60, 64, 66, 68, 70, 72, 76, 78, 80, 82, 84, 88, 90, 92, 94, 96, 100, 102, 104, 106, 108, 112, 114, 116, 118, 120, 124, 126, 128, 130, 132, 136, 138, 140, 142, 144]