A334563 - cp's OEIS frontend

A334563 a(n) is the maximum number of 4-cycles possible in an n-vertex planar graph.

n	a(n)
0	0
1	0
2	0
3	0
4	3
5	9
6	16
7	24
8	33
9	43
10	54
11	66
12	79
13	93
14	108
15	124
16	141
17	159
18	178
19	198
20	219
21	241
22	264
23	288
24	313
25	339
26	366
27	394
28	423
29	453
30	484
31	516
32	549
33	583
34	618
35	654
36	691
37	729
38	768
39	808
40	849
41	891
42	934
43	978
44	1023
45	1069
46	1116
47	1164
48	1213
49	1263
50	1314
51	1366
52	1419
53	1473
54	1528

[0, 0, 0, 0, 3, 9, 16, 24, 33, 43, 54, 66, 79, 93, 108, 124, 141, 159, 178, 198, 219, 241, 264, 288, 313, 339, 366, 394, 423, 453, 484, 516, 549, 583, 618, 654, 691, 729, 768, 808, 849, 891, 934, 978, 1023, 1069, 1116, 1164, 1213, 1263, 1314, 1366, 1419, 1473, 1528]

cp's OEIS Frontend

A334563 a(n) is the maximum number of 4-cycles possible in an n-vertex planar graph.

Table of values

List of values