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.

A280859 T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its king-move neighbors and with new values introduced in order 0 sequentially upwards.

Table of values

n a(n)
1 1
2 2
3 2
4 4
5 9
6 4
7 11
8 29
9 29
10 11
11 30
12 110
13 46
14 110
15 30
16 82
17 442
18 96
19 96
20 442
21 82
22 224
23 1708
24 256
25 124
26 256
27 1708
28 224
29 612
30 6596
31 678
32 216
33 216
34 678
35 6596
36 612
37 1672
38 25624
39 1698
40 462
41 282
42 462
43 1698
44 25624
45 1672
46 4568
47 99432
48 4358
49 1005
50 491
51 491
52 1005
53 4358

List of values

[1, 2, 2, 4, 9, 4, 11, 29, 29, 11, 30, 110, 46, 110, 30, 82, 442, 96, 96, 442, 82, 224, 1708, 256, 124, 256, 1708, 224, 612, 6596, 678, 216, 216, 678, 6596, 612, 1672, 25624, 1698, 462, 282, 462, 1698, 25624, 1672, 4568, 99432, 4358, 1005, 491, 491, 1005, 4358]