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.

A267751 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north 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 3
6 1
7 1
8 10
9 5
10 1
11 1
12 35
13 39
14 8
15 1
16 1
17 126
18 357
19 118
20 11
21 1
22 1
23 462
24 3471
25 2386
26 313
27 15
28 1
29 1
30 1716
31 35003
32 54956
33 13451
34 780
35 19
36 1
37 1
38 6435
39 362265
40 1350674
41 679735
42 68151
43 1789
44 24
45 1
46 1
47 24310
48 3821877
49 34568612
50 37668275
51 7280046
52 314491
53 4024

List of values

[1, 1, 1, 1, 3, 1, 1, 10, 5, 1, 1, 35, 39, 8, 1, 1, 126, 357, 118, 11, 1, 1, 462, 3471, 2386, 313, 15, 1, 1, 1716, 35003, 54956, 13451, 780, 19, 1, 1, 6435, 362265, 1350674, 679735, 68151, 1789, 24, 1, 1, 24310, 3821877, 34568612, 37668275, 7280046, 314491, 4024]