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.

A267278 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 2
7 1
8 10
9 5
10 6
11 1
12 35
13 15
14 5
15 24
16 1
17 126
18 109
19 24
20 4
21 120
22 1
23 462
24 574
25 137
26 24
27 2
28 720
29 1
30 1716
31 2840
32 1138
33 293
34 3
35 4
36 5040
37 1
38 6435
39 13767
40 12214
41 2063
42 317
43 4
44 2
45 40320
46 1
47 24310
48 71646
49 104742
50 18276
51 6240
52 40
53 2
54 4
55 362880
56 1
57 92378
58 390862
59 741057

List of values

[1, 1, 1, 1, 3, 2, 1, 10, 5, 6, 1, 35, 15, 5, 24, 1, 126, 109, 24, 4, 120, 1, 462, 574, 137, 24, 2, 720, 1, 1716, 2840, 1138, 293, 3, 4, 5040, 1, 6435, 13767, 12214, 2063, 317, 4, 2, 40320, 1, 24310, 71646, 104742, 18276, 6240, 40, 2, 4, 362880, 1, 92378, 390862, 741057]