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.

A367443 a(n) is the number of free polyominoes that can be obtained from the polyomino with binary code A246521(n+1) by adding one cell.

Table of values

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

List of values

[1, 2, 4, 3, 9, 1, 5, 4, 3, 8, 6, 5, 11, 10, 10, 6, 6, 9, 5, 2, 4, 5, 11, 13, 11, 3, 12, 9, 11, 10, 11, 5, 11, 5, 11, 12, 11, 12, 5, 6, 10, 5, 13, 12, 12, 7, 6, 6, 7, 11, 11, 6, 11, 6, 5, 4, 12, 11, 11, 13, 12, 11, 12, 14, 13, 12, 6, 7, 11, 3, 11, 11, 10, 11]