A380853 - cp's OEIS frontend

A380853 Number of ways to place six distinct positive integers on a triangle, three on the corners and three on the sides such that the sum of the three values on each side is n.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	1
10	3
11	5
12	13
13	14
14	25
15	37
16	47
17	58
18	89
19	98
20	126
21	159
22	188
23	219
24	276
25	303
26	362
27	423
28	478
29	536
30	633
31	688
32	781
33	881
34	973
35	1068
36	1211
37	1301
38	1443
39	1589
40	1724
41	1866
42	2066
43	2202
44	2396
45	2598
46	2790
47	2986
48	3250
49	3439
50	3699
51	3967
52	4219
53	4480
54	4819
55	5071

[0, 0, 0, 0, 0, 0, 0, 0, 1, 3, 5, 13, 14, 25, 37, 47, 58, 89, 98, 126, 159, 188, 219, 276, 303, 362, 423, 478, 536, 633, 688, 781, 881, 973, 1068, 1211, 1301, 1443, 1589, 1724, 1866, 2066, 2202, 2396, 2598, 2790, 2986, 3250, 3439, 3699, 3967, 4219, 4480, 4819, 5071]

cp's OEIS Frontend

A380853 Number of ways to place six distinct positive integers on a triangle, three on the corners and three on the sides such that the sum of the three values on each side is n.

Table of values

List of values