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.

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

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 1
7 0
8 1
9 2
10 1
11 0
12 1
13 6
14 21
15 1
16 0
17 1
18 19
19 447
20 186
21 1
22 0
23 1
24 70
25 11223
26 40476
27 2113
28 1
29 0
30 1
31 264
32 305863
33 10723968
34 5693966
35 27856
36 1
37 0
38 1
39 1038
40 8862785
41 3152470670
42 19442592272
43 1109065142
44 422481
45 1
46 0
47 1
48 4155
49 267827143
50 995141926013

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 6, 21, 1, 0, 1, 19, 447, 186, 1, 0, 1, 70, 11223, 40476, 2113, 1, 0, 1, 264, 305863, 10723968, 5693966, 27856, 1, 0, 1, 1038, 8862785, 3152470670, 19442592272, 1109065142, 422481, 1, 0, 1, 4155, 267827143, 995141926013]