login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111957 Triangle read by rows: T(n,k) = gcd(Fibonacci(n), Lucas(k)), 1 <= k <= n. 3
1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 7, 1, 3, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 4, 1, 1, 18, 1, 1, 4, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 29, 1, 1, 1, 1, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
Paulo Ribenboim, FFF (Favorite Fibonacci Flowers), Fib. Quart. 43 (No. 1, 2005), 3-14.
FORMULA
T(n, k) = Lucas(g), where g = gcd(n, k), if n/g is even; = 2 if n/g is odd and 3|g; = 1 otherwise.
EXAMPLE
Triangle begins:
1,
1, 1,
1, 1, 2,
1, 3, 1, 1,
1, 1, 1, 1, 1,
1, 1, 4, 1, 1, 2,
1, 1, 1, 1, 1, 1, 1,
1, 3, 1, 7, 1, 3, 1, 1,
1, 1, 2, 1, 1, 2, 1, 1, 2,
1, 1, 1, 1, 11, 1, 1, 1, 1, 1,
=============================
MATHEMATICA
Flatten[Table[GCD[Fibonacci[n], LucasL[k]], {n, 20}, {k, n}]] (* Alonso del Arte, Dec 19 2015 *)
PROG
(Magma) /* As triangle */ [[Gcd(Fibonacci(n), Lucas(k)): k in [1..n]]: n in [1.. 15]]; // Vincenzo Librandi, Dec 20 2015
CROSSREFS
Sequence in context: A144966 A320000 A119805 * A125168 A324725 A328392
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, Nov 28 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:37 EDT 2024. Contains 371906 sequences. (Running on oeis4.)