Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079557
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079557 Numerator for global rational approximations. +0
1
2, 3, 5, 11, 31, 97, 469, 3767, 49729 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) is the smallest integer such that if 0< m1/a(m) < r1/a(r) < 1, m<n and r<n, then there is an integer n1 which satisfies m1/a(m) < n1/a(n) < r1/a(r), but there is no integer n2 with n2/a(n)=m1/a(m) or n2/a(n)=r1/a(r)

EXAMPLE

a(3) is not 4 because 2/4 = 1/2, a(3)=5 because 0 < 1/5 < 1/3 < 2/5 < 1/2 < 3/5 < 2/3 < 4/5 < 1; a(4) is not 7 because if 1/3 < x/7 < 2/5 then x is not an integer

CROSSREFS

Sequence in context: A087580 A072535 A073680 this_sequence A090709 A112279 A130166

Adjacent sequences: A079554 A079555 A079556 this_sequence A079558 A079559 A079560

KEYWORD

nonn

AUTHOR

F. A. G. Lahoz (fran(AT)cmp.es), Jan 24 2003

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 December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research