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.

A141292 Conjectured values for minimal number of pieces required in a 2n-gon to square dissection that uses translation alone.

Table of values

n a(n)
2 1
3 5
4 9
5 12
6 15
7 19
8 22
9 25
10 28
11 31
12 35
13 38
14 42
15 47
16 50
17 53
18 56
19 60
20 63
21 67
22 72
23 76
24 79
25 82
26 85
27 89
28 93
29 100
30 103
31 106
32 109
33 113
34 117
35 121
36 126
37 130
38 133
39 136
40 139
41 143
42 147
43 156
44 160
45 163
46 166
47 169
48 174
49 177
50 182
51 186
52 189
53 192
54 196
55 202
56 205
57 214
58 217
59 220
60 223

List of values

[1, 5, 9, 12, 15, 19, 22, 25, 28, 31, 35, 38, 42, 47, 50, 53, 56, 60, 63, 67, 72, 76, 79, 82, 85, 89, 93, 100, 103, 106, 109, 113, 117, 121, 126, 130, 133, 136, 139, 143, 147, 156, 160, 163, 166, 169, 174, 177, 182, 186, 189, 192, 196, 202, 205, 214, 217, 220, 223]