[seqfan] Re: More (composite) terms for A233281

[Charles Greathouse]

More generally, it is a gcd sequence: gcd(F(m), F(n)) = F(gcd(m, n)).

Charles Greathouse
Analyst/Programmer
Case Western Reserve University


On Tue, Feb 11, 2014 at 10:41 AM, Hans Havermann <gladhobo at teksavvy.com>wrote:

> I asked: "Does any prime factor of any composite Fibonacci number with
> prime index appear as a prime factor for any *other* composite Fibonacci
> number with prime index?"
>
> Apparently this is well known (by those who know it well). Wikipedia says:
> Fibonacci numbers that have a prime index do not share any common divisors
> greater than 1 with the preceding Fibonacci numbers.
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>