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.

A180760 T(n,k)=half the number of nXk binary arrays with each element equal to at least two neighbors.

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 2, 1, 2, 0, 0, 3, 2, 2, 3, 0, 0, 5, 3, 9, 3, 5, 0, 0, 8, 7, 21, 21, 7, 8, 0, 0, 13, 14, 70, 86, 70, 14, 13, 0, 0, 21, 31, 207, 410, 410, 207, 31, 21, 0, 0, 34, 67, 658, 1874, 2986, 1874, 658, 67, 34, 0, 0, 55, 148, 2059, 8840, 20205, 20205, 8840, 2059, 148]