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.

A180771 T(n,k) = half the number of n X k binary arrays with each element equal to at least one neighbor.

Table of values

n a(n)
1 0
2 1
3 1
4 1
5 3
6 1
7 2
8 11
9 11
10 2
11 3
12 34
13 63
14 34
15 3
16 5
17 111
18 390
19 390
20 111
21 5
22 8
23 361
24 2385
25 4475
26 2385
27 361
28 8
29 13
30 1172
31 14621
32 52186
33 52186
34 14621
35 1172
36 13
37 21
38 3809
39 89602
40 606546
41 1154119
42 606546
43 89602
44 3809
45 21
46 34
47 12377
48 549125
49 7053923
50 25448809
51 25448809

List of values

[0, 1, 1, 1, 3, 1, 2, 11, 11, 2, 3, 34, 63, 34, 3, 5, 111, 390, 390, 111, 5, 8, 361, 2385, 4475, 2385, 361, 8, 13, 1172, 14621, 52186, 52186, 14621, 1172, 13, 21, 3809, 89602, 606546, 1154119, 606546, 89602, 3809, 21, 34, 12377, 549125, 7053923, 25448809, 25448809]