A100862 - cp's OEIS frontend

A100862 Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.

n	a(n)
0	1
1	1
2	1
3	1
4	3
5	1
6	1
7	6
8	6
9	1
10	1
11	10
12	21
13	10
14	1
15	1
16	15
17	55
18	55
19	15
20	1
21	1
22	21
23	120
24	215
25	120
26	21
27	1
28	1
29	28
30	231
31	665
32	665
33	231
34	28
35	1
36	1
37	36
38	406
39	1736
40	2835
41	1736
42	406
43	36
44	1
45	1
46	45
47	666
48	3990
49	9891
50	9891
51	3990
52	666
53	45
54	1
55	1
56	55
57	1035
58	8310
59	29505
60	45297
61	29505
62	8310
63	1035
64	55
65	1
66	1
67	66
68	1540
69	16005
70	77715
71	173712
72	173712
73	77715
74	16005
75	1540
76	66
77	1

[1, 1, 1, 1, 3, 1, 1, 6, 6, 1, 1, 10, 21, 10, 1, 1, 15, 55, 55, 15, 1, 1, 21, 120, 215, 120, 21, 1, 1, 28, 231, 665, 665, 231, 28, 1, 1, 36, 406, 1736, 2835, 1736, 406, 36, 1, 1, 45, 666, 3990, 9891, 9891, 3990, 666, 45, 1, 1, 55, 1035, 8310, 29505, 45297, 29505, 8310, 1035, 55, 1, 1, 66, 1540, 16005, 77715, 173712, 173712, 77715, 16005, 1540, 66, 1]

cp's OEIS Frontend

A100862 Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.

Table of values

List of values