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.

A265117 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with row sums equal, column sums equal and full-length antidiagonal sums equal to the short dimension sums.

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 0
6 0
7 1
8 0
9 0
10 0
11 1
12 0
13 8
14 0
15 0
16 1
17 0
18 6
19 0
20 0
21 0
22 1
23 0
24 10
25 624
26 16
27 0
28 0
29 1
30 0
31 26
32 0
33 6592
34 0
35 0
36 0
37 1
38 0
39 42
40 10110
41 8140944
42 126764
43 168
44 0
45 0
46 1
47 0
48 70
49 0
50 195568740
51 0
52 3493730
53 0
54 0
55 0
56 1
57 0
58 150
59 300744

List of values

[1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 8, 0, 0, 1, 0, 6, 0, 0, 0, 1, 0, 10, 624, 16, 0, 0, 1, 0, 26, 0, 6592, 0, 0, 0, 1, 0, 42, 10110, 8140944, 126764, 168, 0, 0, 1, 0, 70, 0, 195568740, 0, 3493730, 0, 0, 0, 1, 0, 150, 300744]