login
This site is supported by donations 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

%I

%S 1,1,1,2,3,5,8,39,235,1096,51909,2491235,348410728,6071656665789,

%T 15126791566796828495,1317584644380565684408069688,

%U 7999921680639175567165604204659004361387

%N a(1)=a(2)=a(3)=1; for n > 3, a(n) = lcm(a(n-1) + a(n-2), a(n-3)).

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

%K nonn

%O 1,4

%A _Leroy Quet_, May 07 2007

%E More terms from _Emeric Deutsch_, May 22 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 14 11:51 EDT 2019. Contains 327997 sequences. (Running on oeis4.)