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.

A266681 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its northwest or northeast 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 101
15 24
16 1
17 1
18 59
19 2520
20 3417
21 120
22 1
23 1
24 257
25 77830
26 781497
27 184881
28 720
29 1
30 1
31 1205
32 2643025
33 235204800
34 508436767
35 14216101
36 5040
37 1
38 1
39 5879
40 96489721
41 81044162960
42 1916370808311
43 559048727531
44 1477674733
45 40320

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 5, 6, 1, 1, 15, 101, 24, 1, 1, 59, 2520, 3417, 120, 1, 1, 257, 77830, 781497, 184881, 720, 1, 1, 1205, 2643025, 235204800, 508436767, 14216101, 5040, 1, 1, 5879, 96489721, 81044162960, 1916370808311, 559048727531, 1477674733, 40320]