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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 0
7 0
8 1
9 0
10 0
11 0
12 3
13 8
14 6
15 0
16 0
17 7
18 14
19 36
20 0
21 0
22 0
23 17
24 52
25 906
26 456
27 120
28 0
29 0
30 42
31 1516
32 31818
33 23592
34 6360
35 0
36 0
37 0
38 104
39 7582
40 770406
41 10213152
42 3304920
43 93600
44 5040
45 0
46 0
47 259
48 46338
49 28194516
50 871718016
51 4067565720
52 334738800
53 1784160
54 0
55 0
56 0
57 648

List of values

[0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 3, 8, 6, 0, 0, 7, 14, 36, 0, 0, 0, 17, 52, 906, 456, 120, 0, 0, 42, 1516, 31818, 23592, 6360, 0, 0, 0, 104, 7582, 770406, 10213152, 3304920, 93600, 5040, 0, 0, 259, 46338, 28194516, 871718016, 4067565720, 334738800, 1784160, 0, 0, 0, 648]