The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A026355 a(n) = least k such that s(k) = n+1, where s = A026354. 9
 1, 2, 3, 5, 6, 8, 10, 11, 13, 14, 16, 18, 19, 21, 23, 24, 26, 27, 29, 31, 32, 34, 35, 37, 39, 40, 42, 44, 45, 47, 48, 50, 52, 53, 55, 57, 58, 60, 61, 63, 65, 66, 68, 69, 71, 73, 74, 76, 78, 79, 81, 82, 84, 86, 87, 89, 90, 92, 94, 95, 97, 99, 100, 102, 103, 105, 107, 108, 110 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Let f(1)=1, f(2)=q and f(k+2) = f(k+1)+f(k)-n; a(n) is the smallest positive integer q such that f(k) -> infinity as k -> infinity. - Benoit Cloitre, Aug 04 2002 LINKS Table of n, a(n) for n=0..68. J. H. Conway and N. J. A. Sloane, Notes on the Para-Fibonacci and related sequences FORMULA For n>0, a(n) = floor((n-1)*phi) + 2, where phi=(1+sqrt(5))/2. Recurrences: a(n+1) = a(n)+(3 + sign(phi*n-a(n)))/2 for n>=0. Also a(n+1) = a(n) + 1 + A005614(n-2) for n>=2. - Benoit Cloitre, Aug 04 2002 PROG (Python) from math import isqrt def A026355(n): return (n-1+isqrt(5*(n-1)**2)>>1)+2 if n else 1 # Chai Wah Wu, Aug 25 2022 CROSSREFS Cf. A000201, A005614, A026351. Different from A007067. Sequence in context: A047448 A260396 A029921 * A099267 A007067 A186322 Adjacent sequences: A026352 A026353 A026354 * A026356 A026357 A026358 KEYWORD nonn,easy AUTHOR Clark Kimberling STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 1 05:26 EST 2024. Contains 370430 sequences. (Running on oeis4.)