A384968 - cp's OEIS frontend

A384968 Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph using exactly k interchangeable colors, 2 <= k <= 2*n.

n	a(n)
1	1
2	1
3	2
4	1
5	1
6	6
7	11
8	6
9	1
10	1
11	14
12	61
13	86
14	50
15	12
16	1
17	1
18	30
19	275
20	770
21	927
22	530
23	150
24	20
25	1
26	1
27	62
28	1141
29	5710
30	12160
31	12632
32	6987
33	2130
34	355
35	30
36	1
37	1
38	126
39	4571
40	38626
41	134981
42	228382
43	209428
44	110768
45	34902
46	6580
47	721
48	42
49	1
50	1
51	254
52	18061
53	248766
54	1367310
55	3553564
56	4989621
57	4093126
58	2061782
59	655788
60	132958
61	16996
62	1316
63	56
64	1

[1, 1, 2, 1, 1, 6, 11, 6, 1, 1, 14, 61, 86, 50, 12, 1, 1, 30, 275, 770, 927, 530, 150, 20, 1, 1, 62, 1141, 5710, 12160, 12632, 6987, 2130, 355, 30, 1, 1, 126, 4571, 38626, 134981, 228382, 209428, 110768, 34902, 6580, 721, 42, 1, 1, 254, 18061, 248766, 1367310, 3553564, 4989621, 4093126, 2061782, 655788, 132958, 16996, 1316, 56, 1]

cp's OEIS Frontend

A384968 Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph using exactly k interchangeable colors, 2 <= k <= 2*n.

Table of values

List of values