A109094 - cp's OEIS frontend

A109094 Length of the longest path (repeated edges not allowed) between two arbitrary, distinct nodes in K_n, the complete graph on n vertices.

n	a(n)
1	0
2	1
3	2
4	5
5	9
6	13
7	20
8	25
9	35
10	41
11	54
12	61
13	77
14	85
15	104
16	113
17	135
18	145
19	170
20	181
21	209
22	221
23	252
24	265
25	299
26	313
27	350
28	365
29	405
30	421
31	464
32	481
33	527
34	545
35	594
36	613
37	665
38	685
39	740
40	761
41	819
42	841
43	902
44	925
45	989
46	1013
47	1080
48	1105
49	1175
50	1201
51	1274
52	1301
53	1377
54	1405

[0, 1, 2, 5, 9, 13, 20, 25, 35, 41, 54, 61, 77, 85, 104, 113, 135, 145, 170, 181, 209, 221, 252, 265, 299, 313, 350, 365, 405, 421, 464, 481, 527, 545, 594, 613, 665, 685, 740, 761, 819, 841, 902, 925, 989, 1013, 1080, 1105, 1175, 1201, 1274, 1301, 1377, 1405]

cp's OEIS Frontend

A109094 Length of the longest path (repeated edges not allowed) between two arbitrary, distinct nodes in K_n, the complete graph on n vertices.

Table of values

List of values