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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027443 For n != 1 mod 3, we can write 3/(2n+1) = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest such a, or 1 if n = 1 mod 3. 1
 1, 15, 35, 1, 165, 91, 1, 153, 247, 1, 207, 75, 1, 435, 651, 1, 63, 185, 1, 615, 1247, 1, 2961, 245, 1, 371, 99, 1, 1239, 1891, 1, 105, 3015, 1, 1917, 2701, 1, 99, 4187, 1, 9213, 187, 1, 4005, 143, 1, 285, 3395, 1, 1313, 4017, 1, 15301, 5995, 1, 4407, 345 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE 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 CROSSREFS Cf. A027442. Sequence in context: A345733 A297729 A156662 * A205148 A253055 A338063 Adjacent sequences:  A027440 A027441 A027442 * A027444 A027445 A027446 KEYWORD nonn AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 26 13:09 EST 2022. Contains 350598 sequences. (Running on oeis4.)