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.

A267629 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any 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 3
6 2
7 1
8 10
9 7
10 6
11 1
12 35
13 39
14 27
15 24
16 1
17 126
18 265
19 208
20 138
21 120
22 1
23 462
24 1802
25 2386
26 1576
27 900
28 720
29 1
30 1716
31 12239
32 32208
33 29387
34 14830
35 7110
36 5040
37 1
38 6435
39 84614
40 445970
41 679735
42 469605
43 168500
44 66150
45 40320
46 1
47 24310
48 597601
49 6039160
50 17761798

List of values

[1, 1, 1, 1, 3, 2, 1, 10, 7, 6, 1, 35, 39, 27, 24, 1, 126, 265, 208, 138, 120, 1, 462, 1802, 2386, 1576, 900, 720, 1, 1716, 12239, 32208, 29387, 14830, 7110, 5040, 1, 6435, 84614, 445970, 679735, 469605, 168500, 66150, 40320, 1, 24310, 597601, 6039160, 17761798]