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.

A266572 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its northwest or southwest neighbor 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 1
6 2
7 1
8 1
9 5
10 6
11 1
12 1
13 15
14 74
15 24
16 1
17 1
18 109
19 2320
20 2668
21 120
22 1
23 1
24 574
25 77830
26 729874
27 150836
28 720
29 1
30 1
31 2840
32 2595190
33 227032241
34 466056593
35 12011058
36 5040
37 1
38 1
39 13767
40 94930586
41 81044162960
42 1814200905314
43 515679132204
44 1279437414

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 5, 6, 1, 1, 15, 74, 24, 1, 1, 109, 2320, 2668, 120, 1, 1, 574, 77830, 729874, 150836, 720, 1, 1, 2840, 2595190, 227032241, 466056593, 12011058, 5040, 1, 1, 13767, 94930586, 81044162960, 1814200905314, 515679132204, 1279437414]