|
Search: id:A051882
|
|
|
| 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. |
|
+0
4
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
R. L. Graham, A theorem on partitions, J. Austral. Math. Soc., 4 (1963), 435-441.
See also R. K. Guy, Unsolved Problems Number Theory, Sect. D11.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences related to Egyptian fractions
|
|
EXAMPLE
|
1=1/2+1/3+1/6, so 2+3+6=11 is strict-sense Egyptian.
|
|
CROSSREFS
|
Cf. A028229.
Sequence in context: A020753 A101947 A167520 this_sequence A136002 A043096 A160542
Adjacent sequences: A051879 A051880 A051881 this_sequence A051883 A051884 A051885
|
|
KEYWORD
|
nonn,fini,full,nice
|
|
AUTHOR
|
Jud McCranie (j.mccranie(AT)comcast.net), Dec 15 1999
|
|
EXTENSIONS
|
Graham showed that every number >=78 is strict-sense Egyptian.
|
|
|
Search completed in 0.002 seconds
|
