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.

A357887 Triangle read by rows: T(n,k) = number of circuits of length k in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n(n-1)/2.

Table of values

n a(n)
1 1
2 2
3 0
4 3
5 0
6 0
7 2
8 4
9 0
10 0
11 8
12 6
13 0
14 0
15 5
16 0
17 0
18 20
19 30
20 24
21 60
22 120
23 0
24 0
25 264
26 6
27 0
28 0
29 40
30 90
31 144
32 480
33 1440
34 2340
35 3840
36 9504
37 15840
38 11160
39 0
40 0
41 0
42 7
43 0
44 0
45 70
46 210
47 504
48 2100
49 8280
50 23940
51 68880
52 217224
53 594720
54 1339800
55 2983680
56 6482880
57 10190880
58 12136320
59 24192000
60 39621120
61 0
62 0
63 129976320

List of values

[1, 2, 0, 3, 0, 0, 2, 4, 0, 0, 8, 6, 0, 0, 5, 0, 0, 20, 30, 24, 60, 120, 0, 0, 264, 6, 0, 0, 40, 90, 144, 480, 1440, 2340, 3840, 9504, 15840, 11160, 0, 0, 0, 7, 0, 0, 70, 210, 504, 2100, 8280, 23940, 68880, 217224, 594720, 1339800, 2983680, 6482880, 10190880, 12136320, 24192000, 39621120, 0, 0, 129976320]