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!)
A008341 a(n)=1, a(n+1) = lcm(a(n),b(n)) / gcd(a(n),b(n)), where {b(n)} = {fibonacci(n)}. 2
1, 1, 1, 2, 6, 30, 60, 780, 1820, 15470, 34034, 3029026, 109044936, 25407470088, 56678202504, 8643425881860, 19344810307020, 30893662060310940, 17264105268997290, 72181224129677669490 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
MAPLE
with(combinat): A008341 := proc(n) option remember; if n = 1 then 1 else lcm(A008341(n-1), fibonacci(n-1))/gcd(A008341(n-1), fibonacci(n-1)); fi; end;
MATHEMATICA
FoldList[ LCM[ #1, #2 ]/GCD[ #1, #2 ]&, 1, Nest[ Join[ #1, {Plus@@Take[ #1, -2 ]} ]&, {1, 1}, 20 ] ]
CROSSREFS
Sequence in context: A369685 A127517 A137825 * A211889 A174276 A117849
KEYWORD
nonn
AUTHOR
EXTENSIONS
Mathematica Program Aug 15 1997 (Olivier Gérard).
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 March 28 11:46 EDT 2024. Contains 371241 sequences. (Running on oeis4.)