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.

A367758 Least number of inequivalent cells in a polyomino with n cells.

Table of values

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

List of values

[1, 1, 2, 1, 2, 2, 3, 2, 3, 3, 4, 2, 4, 4, 5, 3, 4, 5, 6, 3, 5, 6, 7, 4, 5, 7, 8, 4, 6, 8, 9, 5, 6, 9, 10, 5, 7, 10, 11, 6, 7, 11, 12, 6, 8, 12, 13, 7, 8, 13, 14, 7, 9, 14, 15, 8, 9, 15, 16, 8, 10, 16, 17, 9, 10, 17, 18, 9, 11, 18, 19, 10, 11, 19, 20, 10, 12, 20, 21, 11, 12, 21, 22, 11, 13, 22, 23]