login
a(0)=a(1)=1; a(n) = lcm(a(n-1) + a(n-2), n).
0

%I #12 Mar 04 2018 17:44:17

%S 1,1,2,3,20,115,270,385,5240,5625,21730,300905,1290540,20688785,

%T 307710550,328399335,10177758160,178604677415,377564871150,

%U 10567221422735,43779145175540,1141273698563775,26071162562264930

%N a(0)=a(1)=1; a(n) = lcm(a(n-1) + a(n-2), n).

%e Since a(4)=20 and a(5)=115, we have a(6) = lcm(135,6) = 270.

%p 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

%t 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 *)

%Y Cf. A113925.

%K nonn

%O 0,3

%A _Leroy Quet_, Apr 29 2007

%E More terms from _Emeric Deutsch_, May 06 2007