|
Search: id:A071647
|
|
|
| A071647 |
|
a(n) is the maximum number of elements among the continued fractions for n/1, n/2, n/3, n/4 ...., n/n. |
|
+0
2
|
|
| 1, 1, 2, 2, 3, 2, 3, 4, 3, 3, 4, 4, 5, 4, 4, 4, 4, 5, 5, 4, 6, 4, 5, 4, 5, 5, 5, 5, 6, 6, 6, 5, 5, 7, 5, 5, 6, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 6, 7, 7, 6, 6, 6, 5, 8, 6, 6, 6, 6, 7, 6, 6, 6, 7, 7, 7, 7, 7, 7, 6, 7, 6, 7, 7, 7, 8, 6, 6, 8, 8, 8, 7, 7, 6, 7, 7, 7, 7, 9, 6, 7, 7, 7, 7, 7, 6, 8, 7, 7, 7, 7, 7, 8, 7, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
a(n)/log(n) is bounded.
Apart from initial term, same as A034883. - Franklin T. Adams-Watters, Nov 14 2006
|
|
EXAMPLE
|
Continued fractions for 5/1 = [5]; 5/2 = [2, 2]; 5/3 = [1, 1, 2]; 5/4 = [1, 4]; 5/5 = [1] hence a(5) = 3
|
|
PROGRAM
|
(PARI) for(n=1, 150, print1( vecmax(vector(n, i, length(contfrac(n/i)))), ", "))
|
|
CROSSREFS
|
A049810(n) + 1.
Sequence in context: A131818 A070081 A034883 this_sequence A051125 A131830 A091316
Adjacent sequences: A071644 A071645 A071646 this_sequence A071648 A071649 A071650
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 22 2002
|
|
|
Search completed in 0.002 seconds
|
