A326711 - cp's OEIS frontend

A326711 The number of terms in the greedy Egyptian fraction expansion of 1 = 1/n + 1/(n+1) + 1/(n+2) + ... + 1/A069257(n).

n	a(n)
2	3
3	5
4	8
5	11
6	12
7	16
8	18
9	18
10	21
11	25
12	29
13	27
14	28
15	36
16	35
17	35
18	41
19	42
20	42
21	47
22	51
23	52
24	49
25	52
26	56
27	59
28	61
29	67
30	68
31	69
32	72
33	72
34	76
35	80
36	78
37	79
38	89
39	86
40	82
41	92
42	94
43	92
44	101
45	100
46	99
47	102
48	101
49	109
50	108
51	114
52	115
53	114
54	114
55	120
56	125

[3, 5, 8, 11, 12, 16, 18, 18, 21, 25, 29, 27, 28, 36, 35, 35, 41, 42, 42, 47, 51, 52, 49, 52, 56, 59, 61, 67, 68, 69, 72, 72, 76, 80, 78, 79, 89, 86, 82, 92, 94, 92, 101, 100, 99, 102, 101, 109, 108, 114, 115, 114, 114, 120, 125]

cp's OEIS Frontend

A326711 The number of terms in the greedy Egyptian fraction expansion of 1 = 1/n + 1/(n+1) + 1/(n+2) + ... + 1/A069257(n).

Table of values

List of values

n	a(n)
2	3
3	5
4	8
5	11
6	12
7	16
8	18
9	18
10	21
11	25
12	29
13	27
14	28
15	36
16	35
17	35
18	41
19	42
20	42
21	47
22	51
23	52
24	49
25	52
26	56
27	59
28	61
29	67
30	68
31	69
32	72
33	72
34	76
35	80
36	78
37	79
38	89
39	86
40	82
41	92
42	94
43	92
44	101
45	100
46	99
47	102
48	101
49	109
50	108
51	114
52	115
53	114
54	114
55	120
56	125

n	a(n)
2	3
3	5
4	8
5	11
6	12
7	16
8	18
9	18
10	21
11	25
12	29
13	27
14	28
15	36
16	35
17	35
18	41
19	42
20	42
21	47
22	51
23	52
24	49
25	52
26	56
27	59
28	61
29	67
30	68
31	69
32	72
33	72
34	76
35	80
36	78
37	79
38	89
39	86
40	82
41	92
42	94
43	92
44	101
45	100
46	99
47	102
48	101
49	109
50	108
51	114
52	115
53	114
54	114
55	120
56	125

n	a(n)
2	3
3	5
4	8
5	11
6	12
7	16
8	18
9	18
10	21
11	25
12	29
13	27
14	28
15	36
16	35
17	35
18	41
19	42
20	42
21	47
22	51
23	52
24	49
25	52
26	56
27	59
28	61
29	67
30	68
31	69
32	72
33	72
34	76
35	80
36	78
37	79
38	89
39	86
40	82
41	92
42	94
43	92
44	101
45	100
46	99
47	102
48	101
49	109
50	108
51	114
52	115
53	114
54	114
55	120
56	125