A047837 - cp's OEIS frontend

A047837 Honaker's triangle problem: form a triangle with base of length n, all entries different, all row sums equal; a(n) gives minimal row sum.

n	a(n)
1	1
2	3
3	8
4	15
5	27
6	43
7	65
8	94
9	130
10	175
11	229
12	294
13	369
14	456
15	557
16	671
17	800
18	944
19	1105
20	1283
21	1479
22	1695
23	1930
24	2187
25	2465
26	2765
27	3090
28	3439
29	3813
30	4213
31	4641
32	5096
33	5580
34	6095
35	6639
36	7216
37	7825
38	8466
39	9143
40	9855

[1, 3, 8, 15, 27, 43, 65, 94, 130, 175, 229, 294, 369, 456, 557, 671, 800, 944, 1105, 1283, 1479, 1695, 1930, 2187, 2465, 2765, 3090, 3439, 3813, 4213, 4641, 5096, 5580, 6095, 6639, 7216, 7825, 8466, 9143, 9855]

cp's OEIS Frontend

A047837 Honaker's triangle problem: form a triangle with base of length n, all entries different, all row sums equal; a(n) gives minimal row sum.

Table of values

List of values