|
|
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
|
|
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|