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.

A109502 Array read by antidiagonals: T(m,n) is the number of closed walks of length n on the complete graph on m nodes, m >= 1, n >= 0.

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 0
6 0
7 1
8 0
9 1
10 0
11 1
12 0
13 2
14 0
15 0
16 1
17 0
18 3
19 2
20 1
21 0
22 1
23 0
24 4
25 6
26 6
27 0
28 0
29 1
30 0
31 5
32 12
33 21
34 10
35 1
36 0
37 1
38 0
39 6
40 20
41 52
42 60
43 22
44 0
45 0
46 1
47 0
48 7
49 30
50 105
51 204
52 183
53 42
54 1
55 0
56 1
57 0
58 8
59 42
60 186
61 520
62 820
63 546
64 86
65 0
66 0
67 1
68 0
69 9
70 56
71 301
72 1110
73 2605
74 3276
75 1641
76 170
77 1
78 0

List of values

[1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 0, 1, 0, 3, 2, 1, 0, 1, 0, 4, 6, 6, 0, 0, 1, 0, 5, 12, 21, 10, 1, 0, 1, 0, 6, 20, 52, 60, 22, 0, 0, 1, 0, 7, 30, 105, 204, 183, 42, 1, 0, 1, 0, 8, 42, 186, 520, 820, 546, 86, 0, 0, 1, 0, 9, 56, 301, 1110, 2605, 3276, 1641, 170, 1, 0]