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.

A266455 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north neighbor modulo n and the upper left element equal to 0.

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 1
6 1
7 1
8 0
9 5
10 2
11 1
12 3
13 39
14 101
15 9
16 1
17 0
18 357
19 6152
20 3417
21 44
22 1
23 10
24 3471
25 442285
26 2079765
27 184881
28 265
29 1
30 0
31 35003
32 34667512
33 1548940233
34 1362641028
35 14216101
36 1854
37 1
38 35
39 362265
40 2875874396
41 1294905380013
42 12959331192279
43 1511484069811

List of values

[1, 1, 0, 1, 1, 1, 1, 0, 5, 2, 1, 3, 39, 101, 9, 1, 0, 357, 6152, 3417, 44, 1, 10, 3471, 442285, 2079765, 184881, 265, 1, 0, 35003, 34667512, 1548940233, 1362641028, 14216101, 1854, 1, 35, 362265, 2875874396, 1294905380013, 12959331192279, 1511484069811]