A343608 - cp's OEIS frontend

A343608 a(n) = [n/5][n/5 - 1](3n - 10[n/5 + 1])/6, where [.] = floor: upper bound for minimum number of monochromatic triangles in a 3-edge-colored complete graph K_n.

n	a(n)
0	0
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	0
11	1
12	2
13	3
14	4
15	5
16	8
17	11
18	14
19	17
20	20
21	26
22	32
23	38
24	44
25	50
26	60
27	70
28	80
29	90
30	100
31	115
32	130
33	145
34	160
35	175
36	196
37	217
38	238
39	259
40	280
41	308
42	336
43	364
44	392
45	420
46	456
47	492
48	528
49	564
50	600
51	645
52	690
53	735
54	780
55	825
56	880
57	935
58	990
59	1045
60	1100
61	1166

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 8, 11, 14, 17, 20, 26, 32, 38, 44, 50, 60, 70, 80, 90, 100, 115, 130, 145, 160, 175, 196, 217, 238, 259, 280, 308, 336, 364, 392, 420, 456, 492, 528, 564, 600, 645, 690, 735, 780, 825, 880, 935, 990, 1045, 1100, 1166]

cp's OEIS Frontend

A343608 a(n) = [n/5][n/5 - 1](3n - 10[n/5 + 1])/6, where [.] = floor: upper bound for minimum number of monochromatic triangles in a 3-edge-colored complete graph K_n.

Table of values

List of values

cp's OEIS Frontend

A343608 a(n) = [n/5]*[n/5 - 1]*(3n - 10[n/5 + 1])/6, where [.] = floor: upper bound for minimum number of monochromatic triangles in a 3-edge-colored complete graph K_n.

Table of values

List of values

A343608 a(n) = [n/5][n/5 - 1](3n - 10[n/5 + 1])/6, where [.] = floor: upper bound for minimum number of monochromatic triangles in a 3-edge-colored complete graph K_n.