A027442 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A027442

For n odd, >1, not divisible by 3, we can write 3/n = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest a.

%I #7 Mar 31 2012 12:34:58

%S 15,35,165,91,153,247,207,75,435,651,63,185,615,1247,2961,245,371,99,

%T 1239,1891,105,3015,1917,2701,99,4187,9213,187,4005,143,285,3395,1313,

%U 4017,15301,5995,4407,345,255,1089,375,1905,5895,247,9453,6811

%N For n odd, >1, not divisible by 3, we can write 3/n = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest a.

%e 1/15+1/5+1/3=3/5; 1/35+1/15+1/3=3/7; 1/165+1/15+1/5=3/11; 1/91+1/13+1/7=3/13

%Y Cf. A027443.

%K nonn

%O 5,1

%A _N. J. A. Sloane_ and _R. H. Hardin_