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.

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

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 1
6 0
7 1
8 1
9 2
10 0
11 1
12 3
13 2
14 6
15 0
16 1
17 5
18 30
19 6
20 24
21 0
22 1
23 12
24 58
25 630
26 24
27 120
28 0
29 1
30 26
31 588
32 1398
33 22680
34 120
35 720
36 0
37 1
38 60
39 2388
40 93672
41 55896
42 1247400
43 720
44 5040
45 0
46 1
47 143
48 17456
49 609264
50 33807456
51 3353880
52 97297200
53 5040
54 40320
55 0
56 1
57 353
58 102874

List of values

[0, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 3, 2, 6, 0, 1, 5, 30, 6, 24, 0, 1, 12, 58, 630, 24, 120, 0, 1, 26, 588, 1398, 22680, 120, 720, 0, 1, 60, 2388, 93672, 55896, 1247400, 720, 5040, 0, 1, 143, 17456, 609264, 33807456, 3353880, 97297200, 5040, 40320, 0, 1, 353, 102874]