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.

A183380 T(n,k)=Number of nXk binary arrays with no element equal to the mod 3 sum of its king-move neighbors.

Table of values

n a(n)
1 1
2 2
3 2
4 2
5 5
6 2
7 3
8 9
9 9
10 3
11 4
12 20
13 28
14 20
15 4
16 5
17 37
18 68
19 68
20 37
21 5
22 7
23 61
24 143
25 225
26 143
27 61
28 7
29 9
30 144
31 364
32 627
33 627
34 364
35 144
36 9
37 12
38 289
39 952
40 2152
41 2767
42 2152
43 952
44 289
45 12
46 16
47 497
48 2509
49 7036
50 11345
51 11345
52 7036
53 2509
54 497
55 16
56 21
57 1100
58 6412
59 22392
60 51706
61 64530

List of values

[1, 2, 2, 2, 5, 2, 3, 9, 9, 3, 4, 20, 28, 20, 4, 5, 37, 68, 68, 37, 5, 7, 61, 143, 225, 143, 61, 7, 9, 144, 364, 627, 627, 364, 144, 9, 12, 289, 952, 2152, 2767, 2152, 952, 289, 12, 16, 497, 2509, 7036, 11345, 11345, 7036, 2509, 497, 16, 21, 1100, 6412, 22392, 51706, 64530]