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.

A303682 T(n,k) = Number of n X k 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 5
6 3
7 5
8 7
9 7
10 5
11 8
12 17
13 9
14 17
15 8
16 13
17 31
18 15
19 15
20 31
21 13
22 21
23 49
24 25
25 28
26 25
27 49
28 21
29 34
30 103
31 39
32 44
33 44
34 39
35 103
36 34
37 55
38 193
39 57
40 64
41 76
42 64
43 57
44 193
45 55
46 89
47 327
48 87
49 90
50 110
51 110
52 90
53 87
54 327
55 89
56 144
57 641
58 137
59 132
60 150
61 177
62 150
63 132
64 137
65 641
66 144
67 233
68 1207

List of values

[1, 2, 2, 3, 5, 3, 5, 7, 7, 5, 8, 17, 9, 17, 8, 13, 31, 15, 15, 31, 13, 21, 49, 25, 28, 25, 49, 21, 34, 103, 39, 44, 44, 39, 103, 34, 55, 193, 57, 64, 76, 64, 57, 193, 55, 89, 327, 87, 90, 110, 110, 90, 87, 327, 89, 144, 641, 137, 132, 150, 177, 150, 132, 137, 641, 144, 233, 1207]