Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111956
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111956 Triangle read by rows: T(n,k) = gcd(Lucas(n), Lucas(k)), 1 <= k <= n. +0
9
1, 1, 3, 1, 1, 4, 1, 1, 1, 7, 1, 1, 1, 1, 11, 1, 3, 2, 1, 1, 18, 1, 1, 1, 1, 1, 1, 29, 1, 1, 1, 1, 1, 1, 1, 47, 1, 1, 4, 1, 1, 2, 1, 1, 76, 1, 3, 1, 1, 1, 3, 1, 1, 1, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 199, 1, 1, 2, 7, 1, 2, 1, 1, 2, 1, 1, 322, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 521, 1, 3, 1, 1, 1, 3, 1, 1 (list; table; graph; listen)
OFFSET

1,3

REFERENCES

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

FORMULA

T(n, k) = Lucas(g), where g = gcd(n, k), if n/g and k/g are odd; = 2 if n/g or k/g are even and 3|g; = 1 otherwise.

CROSSREFS

Cf. A000032, A111946, A111957.

Sequence in context: A016563 A025254 A000503 this_sequence A024564 A084795 A030184

Adjacent sequences: A111953 A111954 A111955 this_sequence A111957 A111958 A111959

KEYWORD

nonn,tabl

AUTHOR

njas, Nov 28 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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research