|
| |
|
|
A071679
|
|
Least k such that the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4 ...., k/k equals n.
|
|
6
| |
|
|
1, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (1,1).
|
|
|
FORMULA
| Smallest k such that n = Max { 1<=i<=k: Card[ contfrac(k/i) ] } a(1)=1 and for n>1: a(n)=F(n+2) where F(n)=A000045(n) are the Fibonacci numbers.
G.f. : (1+x)^2/(1-x-x^2); a(n)=3F(n+1)-F(n-1)-0^n. - Paul Barry (pbarry(AT)wit.ie), Jul 26 2004
a(n) = Fibonacci(n+2) for n > 1. [Charles R Greathouse IV, Jan 17 2012]
|
|
|
PROG
| (PARI) a(n)=if(n>1, fibonacci(n+2), 1) \\ Charles R Greathouse IV, Jan 17 2012
|
|
|
CROSSREFS
| Sequence in context: A163685 A080614 A079122 * A020701 A024885 A180459
Adjacent sequences: A071676 A071677 A071678 * A071680 A071681 A071682
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 22 2002
|
| |
|
|
