Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106740
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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; listen)
OFFSET

1,1

COMMENT

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).

CROSSREFS

Sequence in context: A141412 A160183 A026807 this_sequence A110619 A129761 A156248

Adjacent sequences: A106737 A106738 A106739 this_sequence A106741 A106742 A106743

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 15 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research