The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109670 a(1) = 1; a(n) is the smallest integer greater than a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 2^n. 0
 1, 4, 30, 85, 91, 401, 1160, 2338, 13392, 31765, 39040, 442431, 667330, 12260875, 12882668, 33163533, 35682489 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE The continued fraction for S(5) = 1 + 1/4 + 1/30 + 1/85 + 1/91 is [1, 3, 3, 1, 2, 1, 11, 32, 5] where the largest element is 32 = 2^5 and 91 is the smallest integer > 85 with this property. MATHEMATICA a[1] = 1; a[n_] := a[n] = Block[{k = a[n - 1] + 1, s = Plus @@ (1/Table[a[i], {i, n - 1}])}, While[ Log[2, Max[ContinuedFraction[s + 1/k]]] != n, k++ ]; k]; Do[ Print[ a[n]], {n, 17}] (* Robert G. Wilson v, Aug 08 2005 *) PROG (PARI) s=1; t=1; for(n=2, 50, s=s+1/t; while(abs(2^n-vecmax(contfrac(s+1/t)))>0, t++); print1(t, ", ")) CROSSREFS Sequence in context: A336493 A296247 A201975 * A014697 A328103 A211624 Adjacent sequences:  A109667 A109668 A109669 * A109671 A109672 A109673 KEYWORD nonn AUTHOR Ryan Propper, Aug 06 2005 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 December 6 13:45 EST 2021. Contains 349563 sequences. (Running on oeis4.)