This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277213 Least k such that Fibonacci(k + 1) has n times as many distinct prime factors as Fibonacci(k), or 0 if no such k exists. 0
 3, 7, 17, 23, 29, 47, 167, 419, 83 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Least k such that A001221(Fibonacci(k+1)) / A001221(Fibonacci(k)) = n, or 0 if no such k exists. LINKS EXAMPLE a(2) = 7 because Fibonacci(8) = 21 = 3*7 (2 distinct prime factors) and Fibonacci(7) = 13 (1 prime factor), and 2/1 is 2. CROSSREFS Cf. A000045, A001221, A022307, A277207. Sequence in context: A254680 A018411 A083989 * A152451 A097958 A118940 Adjacent sequences:  A277210 A277211 A277212 * A277214 A277215 A277216 KEYWORD nonn,more AUTHOR Altug Alkan, Oct 05 2016 EXTENSIONS a(8)-a(9) from Charles R Greathouse IV, Oct 05 2016 STATUS approved

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

Last modified November 15 15:59 EST 2018. Contains 317239 sequences. (Running on oeis4.)