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.

A183450 T(n,k)=Number of nXk binary arrays with every 1 having exactly two king-move neighbors equal to 1.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 5
6 1
7 1
8 9
9 9
10 1
11 1
12 13
13 18
14 13
15 1
16 1
17 33
18 30
19 30
20 33
21 1
22 1
23 69
24 107
25 72
26 107
27 69
28 1
29 1
30 121
31 265
32 283
33 283
34 265
35 121
36 1
37 1
38 253
39 553
40 831
41 2054
42 831
43 553
44 253
45 1
46 1
47 529
48 1505
49 2399
50 9208
51 9208
52 2399
53 1505
54 529
55 1
56 1
57 1013
58 3852
59 7761
60 34867
61 53608
62 34867
63 7761

List of values

[1, 1, 1, 1, 5, 1, 1, 9, 9, 1, 1, 13, 18, 13, 1, 1, 33, 30, 30, 33, 1, 1, 69, 107, 72, 107, 69, 1, 1, 121, 265, 283, 283, 265, 121, 1, 1, 253, 553, 831, 2054, 831, 553, 253, 1, 1, 529, 1505, 2399, 9208, 9208, 2399, 1505, 529, 1, 1, 1013, 3852, 7761, 34867, 53608, 34867, 7761]