A378723 Triangle read by rows: row n gives denominators of n distinct unit fractions (or Egyptian fractions) summing to 1, where denominators are listed in increasing order and the denominators from largest to smallest are as small as possible.
1, 0, 0, 2, 3, 6, 2, 4, 6, 12, 2, 4, 10, 12, 15, 3, 4, 6, 10, 12, 15, 3, 4, 9, 10, 12, 15, 18, 4, 5, 6, 9, 10, 15, 18, 20, 4, 6, 8, 9, 10, 12, 15, 18, 24, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 6, 7, 8, 9, 10, 12, 14, 15, 18, 24, 28, 6, 7, 8, 9, 10, 14, 15, 18, 20, 24, 28, 30
Offset: 1
Examples
Triangle begins: 1; 0, 0; 2, 3, 6; 2, 4, 6, 12; 2, 4, 10, 12, 15; 3, 4, 6, 10, 12, 15; 3, 4, 9, 10, 12, 15, 18; 4, 5, 6, 9, 10, 15, 18, 20; 4, 6, 8, 9, 10, 12, 15, 18, 24; 5, 6, 8, 9, 10, 12, 15, 18, 20, 24; 6, 7, 8, 9, 10, 12, 14, 15, 18, 24, 28; 6, 7, 8, 9, 10, 14, 15, 18, 20, 24, 28, 30; ...
References
- R. K. Guy, Unsolved Problems in Number Theory, 2nd Edition, page 161.
Links
- Sean A. Irvine, Table of n, a(n) for n = 1..136
- K. S. Brown, Unit Fractions, smallest last term.
- Sean A. Irvine Java program (github).
Comments