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!)
A128485 a(1)=a(2)=a(3)=1; for n > 3, a(n) = lcm(a(n-1) + a(n-2), a(n-3)). 1
1, 1, 1, 2, 3, 5, 8, 39, 235, 1096, 51909, 2491235, 348410728, 6071656665789, 15126791566796828495, 1317584644380565684408069688, 7999921680639175567165604204659004361387 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
MAPLE
a[1]:=1: a[2]:=1: a[3]:=1: for n from 4 to 18 do a[n]:=lcm(a[n-1]+a[n-2], a[n-3]) od: seq(a[n], n=1..18); # Emeric Deutsch, May 22 2007
CROSSREFS
Sequence in context: A041008 A041569 A268480 * A042471 A041871 A061249
KEYWORD
nonn
AUTHOR
Leroy Quet, May 07 2007
EXTENSIONS
More terms from Emeric Deutsch, May 22 2007
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 June 21 20:04 EDT 2024. Contains 373559 sequences. (Running on oeis4.)