Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008341
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A008341 a(n)=1, a(n+1) = lcm(a(n),b(n)) / gcd(a(n),b(n)), where {b(n)} = {fibonacci(n)}. +0
2
1, 1, 1, 2, 6, 30, 60, 780, 1820, 15470, 34034, 3029026, 109044936, 25407470088, 56678202504, 8643425881860, 19344810307020, 30893662060310940, 17264105268997290, 72181224129677669490 (list; graph; listen)
OFFSET

1,4

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: A166062 A127517 A137825 this_sequence A117849 A088857 A099081

Adjacent sequences: A008338 A008339 A008340 this_sequence A008342 A008343 A008344

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Mathematica Program Aug 15 1997 (Olivier Gerard).

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research