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.

A266158 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any horizontal, vertical or antidiagonal neighbor equal to n-1.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 0
6 2
7 0
8 0
9 0
10 8
11 0
12 0
13 0
14 16
15 48
16 0
17 0
18 0
19 40
20 1528
21 240
22 0
23 0
24 0
25 272
26 85976
27 71328
28 1968
29 0
30 0
31 0
32 5512
33 7699384
34 55409952
35 10109856
36 13824
37 0
38 0
39 0
40 149232
41 895747208
42 67579399344
43 118728695856
44 949116288
45 140160
46 0
47 0
48 0
49 3741272
50 121920870264

List of values

[1, 0, 0, 0, 0, 2, 0, 0, 0, 8, 0, 0, 0, 16, 48, 0, 0, 0, 40, 1528, 240, 0, 0, 0, 272, 85976, 71328, 1968, 0, 0, 0, 5512, 7699384, 55409952, 10109856, 13824, 0, 0, 0, 149232, 895747208, 67579399344, 118728695856, 949116288, 140160, 0, 0, 0, 3741272, 121920870264]