login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A035105
a(n) = LCM of Fibonacci sequence {F_1,...,F_n}.
15
1, 1, 2, 6, 30, 120, 1560, 10920, 185640, 2042040, 181741560, 1090449360, 254074700880, 7368166325520, 449458145856720, 21124532855265840, 33735878969859546480, 640981700427331383120, 2679944489486672512824720, 109877724068953573025813520
OFFSET
1,3
LINKS
Yuri V. Matiyasevich and Richard K. Guy, A new formula for Pi, The American Mathematical Monthly, Vol 93, No. 8 (1986), pp. 631-635.
Carlo Sanna, On the l.c.m. of shifted Fibonacci numbers, arXiv:2007.13330 [math.NT], 2020.
FORMULA
log(a(n)) ~ 3*n^2*log(phi)/Pi^2, where phi is the golden ratio, or equivalently lim_{n->oo} sqrt(6*log(A003266(n))/log(a(n))) = Pi. - Amiram Eldar, Jan 30 2019
MAPLE
a:= proc(n) option remember; `if`(n=1, 1,
ilcm(a(n-1), combinat[fibonacci](n)))
end:
seq(a(n), n=1..25); # Alois P. Heinz, Feb 12 2018
MATHEMATICA
a[ n_ ] := LCM@@Table[ Fibonacci[ k ], {k, 1, n} ]
With[{fibs=Fibonacci[Range[20]]}, Table[LCM@@Take[fibs, n], {n, Length[ fibs]}]] (* Harvey P. Dale, Apr 29 2019 *)
PROG
(PARI) a(n)=lcm(apply(fibonacci, [1..n])) \\ Charles R Greathouse IV, Oct 07 2016
(Python)
from math import lcm
from sympy import fibonacci
def A035105(n): return lcm(*(fibonacci(i) for i in range(1, n+1))) # Chai Wah Wu, Jul 17 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Fred Schwab (fschwab(AT)nrao.edu)
STATUS
approved