|
Search: id:A130738
|
|
|
| A130738 |
|
Greedy odd Egyptian fraction representation of 1 (without repeats). |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) is the largest odd Egyptian fraction as yet unused, such that the sum of Egyptian fractions so far does not exceed 1. The sum of a(n) is a greedy representation (greedy because each step bites off as much as possible) of 1, using only odd Egyptian fractions, all distinct.
|
|
EXAMPLE
|
E.g. a(8)=721 because 1/721 is the largest odd Egyptian fraction less than 1-1/a(1)-1/a(2)-1/a(3)-1/a(4)-1/a(5)-1/a(6)-1/a(7).
|
|
CROSSREFS
|
Sequence in context: A133854 A030155 A039786 this_sequence A024323 A118820 A117521
Adjacent sequences: A130735 A130736 A130737 this_sequence A130739 A130740 A130741
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jon Wild (wild(AT)music.mcgill.ca), Jul 06 2007
|
|
|
Search completed in 0.002 seconds
|
