|
Search: id:A088527
|
|
|
| A088527 |
|
Define a Fibonacci-type sequence to be one of the form s(1) = s_1 >= 1, s(2) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence. |
|
+0
2
|
|
| 2, 3, 4, 4, 5, 4, 5, 6, 5, 5, 6, 5, 7, 6, 5, 6, 6, 7, 6, 6, 8, 6, 7, 6, 6, 7, 6, 7, 8, 6, 7, 6, 7, 9, 6, 7, 8, 7, 7, 6, 7, 8, 7, 7, 8, 7, 9, 7, 7, 8, 7, 7, 8, 7, 10, 7, 7, 8, 7, 9, 8, 7, 8, 7, 7, 8, 7, 9, 8, 7, 8, 7, 9, 8, 7, 10, 8, 7, 8, 7, 9, 8, 7, 8, 8, 9, 8, 7, 11
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The m-th term in a Fibonacci-type sequence is smallest for the Fibonacci sequence itself. a(Fibonacci(n)) = n (which corresponds to taking s_1 = s_2 = 1). This gives an upper bound a(t) <= log_phi(sqrt(5)*t), roughly. Denes asks: How small can a(n) be, and when do small values occur?
|
|
REFERENCES
|
T. Denes, Problem 413, Discrete Math. 272 (2003), 302 (but there are several errors in the table given there).
|
|
CROSSREFS
|
See A088858 for another version.
Adjacent sequences: A088524 A088525 A088526 this_sequence A088528 A088529 A088530
Sequence in context: A036370 A005208 A110007 this_sequence A030602 A133947 A060197
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas, Nov 20 2003
|
|
EXTENSIONS
|
Corrected and extended by Don Reble (djr(AT)nk.ca), Nov 21 2003
|
|
|
Search completed in 0.002 seconds
|
