A362289 - cp's OEIS frontend

A362289 a(n) is the largest denominator when the greedy algorithm for Egyptian fractions is applied to 1/n + 1/(n+1).

n	a(n)
1	2
2	3
3	12
4	180
5	30
6	1428
7	56
8	2520
9	90
10	2310
11	132
12	100292556
13	182
14	9240
15	240
16	119952
17	306
18	614444040
19	380
20	23100
21	462
22	42190274940
23	552
24	77390453400
25	650
26	201474
27	756
28	23370247110
29	870
30	200880
31	992
32	14523137084239067683872
33	1122
34	2206260
35	1260
36	104845560637757648698080

[2, 3, 12, 180, 30, 1428, 56, 2520, 90, 2310, 132, 100292556, 182, 9240, 240, 119952, 306, 614444040, 380, 23100, 462, 42190274940, 552, 77390453400, 650, 201474, 756, 23370247110, 870, 200880, 992, 14523137084239067683872, 1122, 2206260, 1260, 104845560637757648698080]

cp's OEIS Frontend

A362289 a(n) is the largest denominator when the greedy algorithm for Egyptian fractions is applied to 1/n + 1/(n+1).

Table of values

List of values