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.

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

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 0
6 1
7 0
8 0
9 1
10 1
11 0
12 0
13 1
14 10
15 1
16 0
17 0
18 1
19 32
20 99
21 1
22 0
23 0
24 1
25 236
26 4954
27 1146
28 1
29 0
30 0
31 1
32 1238
33 363850
34 878953
35 15422
36 1
37 0
38 0
39 1
40 7968
41 25964546
42 860077644
43 192333677
44 237135
45 1
46 0
47 0
48 1
49 49214
50 2006263350
51 919241950442
52 3040856393843
53 53404173562

List of values

[1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 10, 1, 0, 0, 1, 32, 99, 1, 0, 0, 1, 236, 4954, 1146, 1, 0, 0, 1, 1238, 363850, 878953, 15422, 1, 0, 0, 1, 7968, 25964546, 860077644, 192333677, 237135, 1, 0, 0, 1, 49214, 2006263350, 919241950442, 3040856393843, 53404173562]