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.

A265656 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal diagonal or antidiagonal neighbors and new values introduced sequentially from 0.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 1
9 7
10 1
11 1
12 2
13 20
14 43
15 1
16 1
17 1
18 104
19 1129
20 372
21 1
22 1
23 2
24 476
25 39913
26 104241
27 4027
28 1
29 1
30 1
31 2428
32 1465545
33 35213302
34 14031233
35 51871
36 1
37 1
38 2
39 12362
40 56069313
41 13162584704
42 59232755329
43 2641322440
44 773186
45 1
46 1
47 1
48 64454
49 2233380101

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 7, 1, 1, 2, 20, 43, 1, 1, 1, 104, 1129, 372, 1, 1, 2, 476, 39913, 104241, 4027, 1, 1, 1, 2428, 1465545, 35213302, 14031233, 51871, 1, 1, 2, 12362, 56069313, 13162584704, 59232755329, 2641322440, 773186, 1, 1, 1, 64454, 2233380101]