A385437 - cp's OEIS frontend

A385437 Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph with a perfect matching removed using exactly k interchangeable colors, for n >= 1 and 2 <= k <= 2n.

n	a(n)
1	1
2	2
3	4
4	1
5	1
6	10
7	20
8	9
9	1
10	1
11	18
12	92
13	146
14	80
15	16
16	1
17	1
18	35
19	355
20	1146
21	1492
22	850
23	220
24	25
25	1
26	1
27	68
28	1336
29	7590
30	17831
31	19740
32	11052
33	3230
34	490
35	36
36	1
37	1
38	133
39	5026
40	47278
41	181251
42	332039
43	320763
44	172788
45	53417
46	9520
47	952
48	49
49	1
50	1
51	262
52	19097
53	287126
54	1710016
55	4809728
56	7204912
57	6180858
58	3177106
59	1003940
60	196728
61	23660
62	1680
63	64
64	1

[1, 2, 4, 1, 1, 10, 20, 9, 1, 1, 18, 92, 146, 80, 16, 1, 1, 35, 355, 1146, 1492, 850, 220, 25, 1, 1, 68, 1336, 7590, 17831, 19740, 11052, 3230, 490, 36, 1, 1, 133, 5026, 47278, 181251, 332039, 320763, 172788, 53417, 9520, 952, 49, 1, 1, 262, 19097, 287126, 1710016, 4809728, 7204912, 6180858, 3177106, 1003940, 196728, 23660, 1680, 64, 1]

cp's OEIS Frontend

A385437 Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph with a perfect matching removed using exactly k interchangeable colors, for n >= 1 and 2 <= k <= 2n.

Table of values

List of values