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.

A265192 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal 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 1
6 1
7 0
8 0
9 5
10 1
11 0
12 1
13 17
14 36
15 1
16 0
17 0
18 42
19 774
20 329
21 1
22 0
23 1
24 155
25 20592
26 76035
27 3655
28 1
29 0
30 0
31 511
32 583806
33 20957398
34 10866362
35 47844
36 1
37 0
38 1
39 2023
40 17355854
41 6394366422
42 38833756515
43 2130866037
44 721315
45 1
46 0
47 0
48 7760
49 531710144

List of values

[1, 0, 1, 0, 1, 1, 0, 0, 5, 1, 0, 1, 17, 36, 1, 0, 0, 42, 774, 329, 1, 0, 1, 155, 20592, 76035, 3655, 1, 0, 0, 511, 583806, 20957398, 10866362, 47844, 1, 0, 1, 2023, 17355854, 6394366422, 38833756515, 2130866037, 721315, 1, 0, 0, 7760, 531710144]