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.

A051754 Consider problem of placing N queens on an n X n board so that each queen attacks precisely 1 other. Sequence gives maximal number of queens.

Table of values

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

List of values

[2, 2, 4, 4, 8, 8, 10, 12, 12, 14, 16, 16, 18, 20, 20, 22, 24, 24, 26, 28, 28, 30, 32, 32, 34, 36, 36, 38, 40, 40, 42, 44, 44, 46, 48, 48, 50, 52, 52, 54, 56, 56, 58, 60, 60, 62, 64, 64, 66, 68, 68, 70, 72, 72, 74, 76, 76, 78, 80, 80, 82, 84, 84, 86]

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

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