Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066849
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066849 Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer so that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of m; set a(n) = -1 if some fraction i/n never appears. +0
4
1, 2, 3, 401, 113, 22, 75, 401, 1986, 6547, 1110, 5949, 7952, 2445, 5578, 172617, 2590, 1986, 17471, 41341, 13631, 20900, 14063, 121563, 86009, 17648, 392866, 140171, 59293, 257162, 68370, 172617, 226693, 89942, 489653, 151601, 153287, 231508, 860521, 999664, 479352, 751180, 475540, 1312350, 246470, 287004, 84285, 1137690, 363942, 86009, 276267, 603972, 219888, 1139722, 1525515, 5227193, 1486480, 206546, 379708, 1244626, 374003, 590152, 7230480, 1903679, 1834403 (list; graph; listen)
OFFSET

1,2

EXAMPLE

3/4 does not occur until we reach A066720(401) = 2436 and then we see A066720(320)/A066720(401) = 1827/2436 = 3/4. Therefore a(4) = 401.

CROSSREFS

Cf. A066720, A066657, A066658. A066848 gives values of k.

Sequence in context: A110931 A097654 A156986 this_sequence A071219 A109855 A128874

Adjacent sequences: A066846 A066847 A066848 this_sequence A066850 A066851 A066852

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jan 21 2002

EXTENSIONS

Corrected by John Layman, Feb 05 2002.

Greatly extended by David Applegate (david(AT)research.att.com), Feb 13, 2002.

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 November 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research