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.

A100898 Triangle read by rows: T(n,k) is the number of k-matchings of the fan graph on n+1 vertices (i.e., the join of the path graph on n vertices with one extra vertex).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 3
5 1
6 5
7 2
8 1
9 7
10 7
11 1
12 9
13 15
14 3
15 1
16 11
17 26
18 13
19 1
20 13
21 40
22 34
23 4
24 1
25 15
26 57
27 70
28 21
29 1
30 17
31 77
32 125
33 65
34 5
35 1
36 19
37 100
38 203
39 155
40 31
41 1
42 21
43 126
44 308
45 315
46 111
47 6
48 1
49 23
50 155
51 444
52 574
53 301
54 43
55 1
56 25
57 187
58 615
59 966
60 686
61 175
62 7
63 1
64 27
65 222
66 825
67 1530
68 1386
69 532
70 57

List of values

[1, 1, 1, 1, 3, 1, 5, 2, 1, 7, 7, 1, 9, 15, 3, 1, 11, 26, 13, 1, 13, 40, 34, 4, 1, 15, 57, 70, 21, 1, 17, 77, 125, 65, 5, 1, 19, 100, 203, 155, 31, 1, 21, 126, 308, 315, 111, 6, 1, 23, 155, 444, 574, 301, 43, 1, 25, 187, 615, 966, 686, 175, 7, 1, 27, 222, 825, 1530, 1386, 532, 57]