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.

A265089 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with row sums equal and column sums equal.

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 2
6 0
7 1
8 0
9 6
10 0
11 1
12 6
13 12
14 24
15 0
16 1
17 0
18 90
19 0
20 120
21 0
22 1
23 20
24 360
25 4464
26 1080
27 720
28 0
29 1
30 0
31 2040
32 0
33 493920
34 0
35 6300
36 0
37 1
38 70
39 10080
40 2850360
41 75502080
42 128269440
43 3135720
44 45360
45 0
46 1
47 0
48 54810
49 0
50 16074373800
51 0
52 57943903500
53 0
54 589680
55 0
56 1
57 252

List of values

[1, 1, 0, 1, 2, 0, 1, 0, 6, 0, 1, 6, 12, 24, 0, 1, 0, 90, 0, 120, 0, 1, 20, 360, 4464, 1080, 720, 0, 1, 0, 2040, 0, 493920, 0, 6300, 0, 1, 70, 10080, 2850360, 75502080, 128269440, 3135720, 45360, 0, 1, 0, 54810, 0, 16074373800, 0, 57943903500, 0, 589680, 0, 1, 252]