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.

A267901 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 2
6 0
7 1
8 3
9 6
10 0
11 1
12 11
13 20
14 30
15 0
16 1
17 29
18 268
19 138
20 192
21 0
22 1
23 93
24 2324
25 17658
26 1488
27 1560
28 0
29 1
30 268
31 28318
32 414138
33 1696920
34 20400
35 15120
36 0
37 1
38 842
39 315196
40 28493946
41 134764368
42 273460560
43 317520
44 171360
45 0
46 1
47 2547
48 3786836
49 1246334388

List of values

[0, 1, 0, 1, 2, 0, 1, 3, 6, 0, 1, 11, 20, 30, 0, 1, 29, 268, 138, 192, 0, 1, 93, 2324, 17658, 1488, 1560, 0, 1, 268, 28318, 414138, 1696920, 20400, 15120, 0, 1, 842, 315196, 28493946, 134764368, 273460560, 317520, 171360, 0, 1, 2547, 3786836, 1246334388]