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.

A265241 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal 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 4
9 10
10 1
11 1
12 8
13 92
14 68
15 1
16 1
17 16
18 888
19 4716
20 604
21 1
22 1
23 32
24 8880
25 359172
26 414716
27 6584
28 1
29 1
30 64
31 91180
32 29189088
33 327847656
34 55210372
35 85048
36 1
37 1
38 128
39 955320
40 2481226704
41 284341627344
42 559450092072
43 10337500044
44 1269680
45 1
46 1
47 256

List of values

[1, 1, 1, 1, 2, 1, 1, 4, 10, 1, 1, 8, 92, 68, 1, 1, 16, 888, 4716, 604, 1, 1, 32, 8880, 359172, 414716, 6584, 1, 1, 64, 91180, 29189088, 327847656, 55210372, 85048, 1, 1, 128, 955320, 2481226704, 284341627344, 559450092072, 10337500044, 1269680, 1, 1, 256]