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.

A267019 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any northeast 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 8
15 24
16 1
17 126
18 59
19 21
20 11
21 120
22 1
23 462
24 257
25 137
26 45
27 15
28 720
29 1
30 1716
31 1205
32 759
33 259
34 37
35 19
36 5040
37 1
38 6435
39 5879
40 4835
41 2063
42 537
43 147
44 24
45 40320
46 1
47 24310
48 29693
49 31591
50 18157
51 5493
52 1015
53 62
54 29
55 362880
56 1
57 92378
58 153097

List of values

[1, 1, 1, 1, 3, 2, 1, 10, 5, 6, 1, 35, 15, 8, 24, 1, 126, 59, 21, 11, 120, 1, 462, 257, 137, 45, 15, 720, 1, 1716, 1205, 759, 259, 37, 19, 5040, 1, 6435, 5879, 4835, 2063, 537, 147, 24, 40320, 1, 24310, 29693, 31591, 18157, 5493, 1015, 62, 29, 362880, 1, 92378, 153097]