Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111946
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111946 Triangle read by rows: T(n,k) = gcd(Fibonacci(n), Fibonacci(k)), 1 <= k <= n. +0
3
1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 5, 1, 1, 2, 1, 1, 8, 1, 1, 1, 1, 1, 1, 13, 1, 1, 1, 3, 1, 1, 1, 21, 1, 1, 2, 1, 1, 2, 1, 1, 34, 1, 1, 1, 1, 5, 1, 1, 1, 1, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 89, 1, 1, 2, 3, 1, 8, 1, 3, 2, 1, 1, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 233, 1, 1, 1, 1, 1, 1, 13, 1, 1, 1 (list; table; graph; listen)
OFFSET

1,6

REFERENCES

P. Ribenboim, FFF (Favorite Fibonacci Flowers), Fib. Q. 43 (No. 1, 2005), 3-14.

FORMULA

T(n, k) = Fibonacci(g), where g = gcd(n, k).

CROSSREFS

Cf. A000045, A111956, A111957.

Sequence in context: A085476 A124944 A094392 this_sequence A137844 A079229 A160267

Adjacent sequences: A111943 A111944 A111945 this_sequence A111947 A111948 A111949

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Nov 28 2005

page 1

Search completed in 0.004 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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research