A019445 - cp's OEIS frontend

A019445 Form a permutation of the positive integers, p_1, p_2, ..., such that the average of each initial segment is an integer, using the greedy algorithm to define p_n; sequence gives p_1 + ... + p_n.

n	a(n)
1	1
2	4
3	6
4	12
5	20
6	24
7	35
8	40
9	54
10	70
11	77
12	96
13	117
14	126
15	150
16	160
17	187
18	216
19	228
20	260
21	273
22	308
23	345
24	360
25	400
26	442
27	459
28	504
29	522
30	570
31	620
32	640
33	693
34	748
35	770
36	828
37	851
38	912
39	975
40	1000
41	1066
42	1092
43	1161
44	1232
45	1260
46	1334
47	1410
48	1440
49	1519
50	1550

[1, 4, 6, 12, 20, 24, 35, 40, 54, 70, 77, 96, 117, 126, 150, 160, 187, 216, 228, 260, 273, 308, 345, 360, 400, 442, 459, 504, 522, 570, 620, 640, 693, 748, 770, 828, 851, 912, 975, 1000, 1066, 1092, 1161, 1232, 1260, 1334, 1410, 1440, 1519, 1550]

cp's OEIS Frontend

A019445 Form a permutation of the positive integers, p_1, p_2, ..., such that the average of each initial segment is an integer, using the greedy algorithm to define p_n; sequence gives p_1 + ... + p_n.

Table of values

List of values