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.

A268142 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one diagonal 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 0
14 6
15 0
16 0
17 5
18 8
19 6
20 0
21 0
22 0
23 12
24 32
25 672
26 0
27 120
28 0
29 0
30 26
31 238
32 4734
33 5760
34 120
35 0
36 0
37 0
38 60
39 1488
40 177048
41 218880
42 1411560
43 0
44 5040
45 0
46 0
47 143
48 9778
49 4131792
50 59028840
51 97608120
52 25024320
53 5040
54 0
55 0
56 0
57 353
58 91628
59 132137160

List of values

[0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 3, 0, 6, 0, 0, 5, 8, 6, 0, 0, 0, 12, 32, 672, 0, 120, 0, 0, 26, 238, 4734, 5760, 120, 0, 0, 0, 60, 1488, 177048, 218880, 1411560, 0, 5040, 0, 0, 143, 9778, 4131792, 59028840, 97608120, 25024320, 5040, 0, 0, 0, 353, 91628, 132137160]