A051882 - cp's OEIS frontend

A051882 Call m strict-sense Egyptian if we can partition m = x_1+x_2+...+x_k into distinct positive integers x_i such that Sum_{i=1..k} 1/x_i = 1; sequence gives all numbers that are not strict-sense Egyptian.

n	a(n)
1	2
2	3
3	4
4	5
5	6
6	7
7	8
8	9
9	10
10	12
11	13
12	14
13	15
14	16
15	17
16	18
17	19
18	20
19	21
20	22
21	23
22	25
23	26
24	27
25	28
26	29
27	33
28	34
29	35
30	36
31	39
32	40
33	41
34	42
35	44
36	46
37	47
38	48
39	49
40	51
41	56
42	58
43	63
44	68
45	70
46	72
47	77

[2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 33, 34, 35, 36, 39, 40, 41, 42, 44, 46, 47, 48, 49, 51, 56, 58, 63, 68, 70, 72, 77]

cp's OEIS Frontend

A051882 Call m strict-sense Egyptian if we can partition m = x_1+x_2+...+x_k into distinct positive integers x_i such that Sum_{i=1..k} 1/x_i = 1; sequence gives all numbers that are not strict-sense Egyptian.

Table of values

List of values

n	a(n)
1	2
2	3
3	4
4	5
5	6
6	7
7	8
8	9
9	10
10	12
11	13
12	14
13	15
14	16
15	17
16	18
17	19
18	20
19	21
20	22
21	23
22	25
23	26
24	27
25	28
26	29
27	33
28	34
29	35
30	36
31	39
32	40
33	41
34	42
35	44
36	46
37	47
38	48
39	49
40	51
41	56
42	58
43	63
44	68
45	70
46	72
47	77

n	a(n)
1	2
2	3
3	4
4	5
5	6
6	7
7	8
8	9
9	10
10	12
11	13
12	14
13	15
14	16
15	17
16	18
17	19
18	20
19	21
20	22
21	23
22	25
23	26
24	27
25	28
26	29
27	33
28	34
29	35
30	36
31	39
32	40
33	41
34	42
35	44
36	46
37	47
38	48
39	49
40	51
41	56
42	58
43	63
44	68
45	70
46	72
47	77

n	a(n)
1	2
2	3
3	4
4	5
5	6
6	7
7	8
8	9
9	10
10	12
11	13
12	14
13	15
14	16
15	17
16	18
17	19
18	20
19	21
20	22
21	23
22	25
23	26
24	27
25	28
26	29
27	33
28	34
29	35
30	36
31	39
32	40
33	41
34	42
35	44
36	46
37	47
38	48
39	49
40	51
41	56
42	58
43	63
44	68
45	70
46	72
47	77