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.

A266309 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its west 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 7
10 6
11 1
12 1
13 39
14 171
15 24
16 1
17 1
18 265
19 8190
20 6666
21 120
22 1
23 1
24 1802
25 442285
26 3264584
27 384360
28 720
29 1
30 1
31 12239
32 25839438
33 1935720551
34 2357929910
35 30900150
36 5040
37 1
38 1
39 84614
40 1605405629
41 1294905380013
42 18647592370365
43 2805027363620

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 7, 6, 1, 1, 39, 171, 24, 1, 1, 265, 8190, 6666, 120, 1, 1, 1802, 442285, 3264584, 384360, 720, 1, 1, 12239, 25839438, 1935720551, 2357929910, 30900150, 5040, 1, 1, 84614, 1605405629, 1294905380013, 18647592370365, 2805027363620]