

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




OFFSET

1,1


COMMENTS

Least k such that A001221(Fibonacci(k+1)) / A001221(Fibonacci(k)) = n, or 0 if no such k exists.


LINKS

Table of n, a(n) for n=1..9.


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



