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.

A266208 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any horizontal, vertical, diagonal 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 8
15 48
16 0
17 0
18 0
19 8
20 544
21 240
22 0
23 0
24 0
25 16
26 7368
27 20976
28 1968
29 0
30 0
31 0
32 312
33 225112
34 5909712
35 3124800
36 13824
37 0
38 0
39 0
40 14936
41 14336176
42 2985074304
43 12981441744
44 269723136
45 140160
46 0
47 0
48 0
49 310552
50 1009920648
51 2484237295056

List of values

[1, 0, 0, 0, 0, 2, 0, 0, 0, 8, 0, 0, 0, 8, 48, 0, 0, 0, 8, 544, 240, 0, 0, 0, 16, 7368, 20976, 1968, 0, 0, 0, 312, 225112, 5909712, 3124800, 13824, 0, 0, 0, 14936, 14336176, 2985074304, 12981441744, 269723136, 140160, 0, 0, 0, 310552, 1009920648, 2484237295056]