%I A051907
%S A051907 1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,1,0,0,0,
%T A051907 0,1,1,0,0,0,0,1,0,2,0,0,0,0,2,0,1,1,1,1,0,2,0,1,1,1,2,0,4,1,3,4,0,2,0,
%U A051907 6,0,1,2,1,3,0,4,2,1,5,5,3,2,3,3,5,5,5,2,1,12,5,4,11,4,5,2,11,3,5
%N A051907 Number of ways to express 1 as the sum of distinct unit fractions such 
               that the sum of the denominators is n.
%H A051907 <a href="Sindx_Ed.html#Egypt">Index entries for sequences related to 
               Egyptian fractions</a>
%e A051907 1 = 1/2+1/4+1/9+1/12+1/18 = 1/2+1/5+1/6+1/12+1/20. The sum of the denominators 
               of each of these is 45, these are the only 2 with sum of denominators 
               = 45, so a(45)=2.
%Y A051907 A051882 lists n such that a(n)=0.
%Y A051907 Sequence in context: A001343 A022882 A000089 this_sequence A093569 A073091 
               A125250
%Y A051907 Adjacent sequences: A051904 A051905 A051906 this_sequence A051908 A051909 
               A051910
%K A051907 nonn
%O A051907 1,45
%A A051907 Jud McCranie (j.mccranie(AT)comcast.net), Dec 16 1999
%E A051907 R. L. Graham showed that a(n)>0 for n>77.