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.

A266183 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any diagonal or antidiagonal neighbor equal to n-1.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 6
7 1
8 2
9 22
10 24
11 1
12 2
13 88
14 384
15 120
16 1
17 2
18 296
19 7768
20 19080
21 720
22 1
23 2
24 1372
25 226296
26 4027960
27 1019328
28 5040
29 1
30 2
31 6128
32 7089448
33 1203241488
34 2437859280
35 106546608
36 40320
37 1
38 2
39 29552
40 253282792
41 409870443648
42 8822224268688

List of values

[1, 1, 2, 1, 2, 6, 1, 2, 22, 24, 1, 2, 88, 384, 120, 1, 2, 296, 7768, 19080, 720, 1, 2, 1372, 226296, 4027960, 1019328, 5040, 1, 2, 6128, 7089448, 1203241488, 2437859280, 106546608, 40320, 1, 2, 29552, 253282792, 409870443648, 8822224268688]