Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066105
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066105 Indices of the maximum increasing subsequences of A066848 and A066849. +0
1
1, 2, 3, 4, 9, 10, 13, 16, 27, 35, 39, 40, 44, 55, 56, 63, 66 (list; graph; listen)
OFFSET

0,2

COMMENT

In other words, a_k is the smallest denominator that is not covered by the time a_{k-1} is covered. This sequence is finite if there is a denominator that is never covered.

CROSSREFS

Sequence in context: A084368 A007498 A073338 this_sequence A083180 A098551 A128944

Adjacent sequences: A066102 A066103 A066104 this_sequence A066106 A066107 A066108

KEYWORD

nonn

AUTHOR

David Applegate (david(AT)research.att.com), May 14 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research