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.

A282996 T(n,k) is the number of n X k 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors.

Table of values

n a(n)
1 2
2 4
3 4
4 7
5 11
6 7
7 13
8 33
9 33
10 13
11 24
12 98
13 163
14 98
15 24
16 44
17 291
18 803
19 803
20 291
21 44
22 81
23 865
24 3971
25 6547
26 3971
27 865
28 81
29 149
30 2570
31 19587
32 53389
33 53389
34 19587
35 2570
36 149
37 274
38 7637
39 96693
40 435027
41 720417
42 435027
43 96693
44 7637
45 274
46 504
47 22693
48 477297
49 3546870

List of values

[2, 4, 4, 7, 11, 7, 13, 33, 33, 13, 24, 98, 163, 98, 24, 44, 291, 803, 803, 291, 44, 81, 865, 3971, 6547, 3971, 865, 81, 149, 2570, 19587, 53389, 53389, 19587, 2570, 149, 274, 7637, 96693, 435027, 720417, 435027, 96693, 7637, 274, 504, 22693, 477297, 3546870]