login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A106740 Triangle read by rows: greatest common divisors of pairs of Fibonacci numbers greater than 1: T(n,k) = GCD(Fib(n),Fib(k)), 2<k<n. 0
2, 1, 3, 1, 1, 5, 2, 1, 1, 8, 1, 1, 1, 1, 13, 1, 3, 1, 1, 1, 21, 2, 1, 1, 2, 1, 1, 34, 1, 1, 5, 1, 1, 1, 1, 55, 1, 1, 1, 1, 1, 1, 1, 1, 89, 2, 3, 1, 8, 1, 3, 2, 1, 1, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 233, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 377, 2, 1, 5, 2, 1, 1, 2, 5, 1, 2, 1, 1, 610, 1, 3, 1, 1, 1, 21, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

T(n,k) = GCD(A000045(n), A000045(k)), 2<k<n;

T(n,3) = abs(A061347(n)) for n>2;

T(n,4) = A093148(n) for n>3;

T(n,n) = A000045(n).

LINKS

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

CROSSREFS

Sequence in context: A168534 A026807 A179045 * A178534 A110619 A191861

Adjacent sequences:  A106737 A106738 A106739 * A106741 A106742 A106743

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller, May 15 2005

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 25 03:49 EST 2020. Contains 331241 sequences. (Running on oeis4.)