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.

A300089 T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 4
6 3
7 5
8 4
9 4
10 5
11 8
12 8
13 1
14 8
15 8
16 13
17 32
18 4
19 4
20 32
21 13
22 21
23 32
24 10
25 25
26 10
27 32
28 21
29 34
30 64
31 6
32 50
33 50
34 6
35 64
36 34
37 55
38 256
39 19
40 98
41 415
42 98
43 19
44 256
45 55
46 89
47 256
48 41
49 359
50 533
51 533
52 359
53 41
54 256
55 89
56 144
57 512
58 32
59 766
60 3089
61 1822
62 3089
63 766
64 32
65 512
66 144
67 233
68 2048
69 106

List of values

[1, 2, 2, 3, 4, 3, 5, 4, 4, 5, 8, 8, 1, 8, 8, 13, 32, 4, 4, 32, 13, 21, 32, 10, 25, 10, 32, 21, 34, 64, 6, 50, 50, 6, 64, 34, 55, 256, 19, 98, 415, 98, 19, 256, 55, 89, 256, 41, 359, 533, 533, 359, 41, 256, 89, 144, 512, 32, 766, 3089, 1822, 3089, 766, 32, 512, 144, 233, 2048, 106]