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!)
A128977 a(0)=a(1)=1; a(n) = lcm(a(n-1) + a(n-2), n). 0
1, 1, 2, 3, 20, 115, 270, 385, 5240, 5625, 21730, 300905, 1290540, 20688785, 307710550, 328399335, 10177758160, 178604677415, 377564871150, 10567221422735, 43779145175540, 1141273698563775, 26071162562264930 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
Since a(4)=20 and a(5)=115, we have a(6) = lcm(135,6) = 270.
MAPLE
a[0]:=1: a[1]:=1: for n from 2 to 26 do a[n]:=lcm(a[n-1]+a[n-2], n) od: seq(a[n], n=0..26); # Emeric Deutsch, May 06 2007
MATHEMATICA
RecurrenceTable[{a[0]==a[1]==1, a[n]==LCM[a[n-1]+a[n-2], n]}, a, {n, 30}] (* Harvey P. Dale, Apr 17 2012 *)
CROSSREFS
Cf. A113925.
Sequence in context: A165960 A125763 A042441 * A375683 A069323 A356884
KEYWORD
nonn
AUTHOR
Leroy Quet, Apr 29 2007
EXTENSIONS
More terms from Emeric Deutsch, May 06 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 August 24 18:26 EDT 2024. Contains 375417 sequences. (Running on oeis4.)