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.

A281205 T(n,k)=Number of nXk 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 2
6 0
7 2
8 14
9 10
10 0
11 5
12 28
13 56
14 38
15 0
16 10
17 52
18 98
19 168
20 130
21 0
22 20
23 94
24 176
25 270
26 448
27 420
28 0
29 38
30 166
31 310
32 470
33 676
34 1120
35 1308
36 0
37 71
38 290
39 537
40 804
41 1141
42 1588
43 2688
44 3970
45 0
46 130
47 502
48 922
49 1358
50 1906
51 2602
52 3604
53 6272
54 11822
55 0
56 235
57 864
58 1573
59 2284
60 3137

List of values

[0, 0, 0, 1, 2, 0, 2, 14, 10, 0, 5, 28, 56, 38, 0, 10, 52, 98, 168, 130, 0, 20, 94, 176, 270, 448, 420, 0, 38, 166, 310, 470, 676, 1120, 1308, 0, 71, 290, 537, 804, 1141, 1588, 2688, 3970, 0, 130, 502, 922, 1358, 1906, 2602, 3604, 6272, 11822, 0, 235, 864, 1573, 2284, 3137]