Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109670
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1, 4, 30, 85, 91, 401, 1160, 2338, 13392, 31765, 39040, 442431, 667330, 12260875, 12882668, 33163533, 35682489 (list; graph; listen)
OFFSET

1,2

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}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 08 2005)

PROGRAM

(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: A126559 A022387 A108559 this_sequence A014697 A027297 A027445

Adjacent sequences: A109667 A109668 A109669 this_sequence A109671 A109672 A109673

KEYWORD

nonn

AUTHOR

Ryan Propper (rpropper(AT)stanford.edu), Aug 06 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research