A348453 - cp's OEIS frontend

A348453 Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= number of divisors of n^2) is the number of ways to tile an n X n chessboard with d_k rook-connected polyominoes of equal area, where d_k is the k-th divisor of n^2.

n	a(n)
1	1
2	1
3	2
4	1
5	1
6	10
7	1
8	1
9	70
10	117
11	36
12	1
13	1
14	4006
15	1
16	1
17	80518
18	264500
19	442791
20	451206
21	178939
22	80092
23	6728
24	1
25	1
26	158753814
27	1
28	7157114189

[1, 1, 2, 1, 1, 10, 1, 1, 70, 117, 36, 1, 1, 4006, 1, 1, 80518, 264500, 442791, 451206, 178939, 80092, 6728, 1, 1, 158753814, 1, 7157114189]