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.

A212801 Square array read by antidiagonals: T(m,n) = number of Eulerian circuits in the Cartesian product of two directed cycles of lengths m and n.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 4
6 1
7 1
8 13
9 13
10 1
11 1
12 40
13 108
14 40
15 1
16 1
17 121
18 793
19 793
20 121
21 1
22 1
23 364
24 5611
25 12800
26 5611
27 364
28 1
29 1
30 1093
31 39312
32 193721
33 193721
34 39312
35 1093
36 1
37 1
38 3280
39 274933
40 2886520
41 6050000
42 2886520
43 274933
44 3280
45 1
46 1
47 9841
48 1923025
49 42999713
50 183990301
51 183990301
52 42999713
53 1923025
54 9841
55 1

List of values

[1, 1, 1, 1, 4, 1, 1, 13, 13, 1, 1, 40, 108, 40, 1, 1, 121, 793, 793, 121, 1, 1, 364, 5611, 12800, 5611, 364, 1, 1, 1093, 39312, 193721, 193721, 39312, 1093, 1, 1, 3280, 274933, 2886520, 6050000, 2886520, 274933, 3280, 1, 1, 9841, 1923025, 42999713, 183990301, 183990301, 42999713, 1923025, 9841, 1]