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!)
A123274 a(0)=a(1)=a(2) = 1. a(n) = (a(n-1) +a(n-2)) /GCD(a(n-1)+a(n-2),a(n-3)), for n >= 3. 0

%I #11 Nov 01 2019 12:38:03

%S 1,1,1,2,3,5,4,3,7,5,4,9,13,11,8,19,27,23,50,73,123,98,221,319,270,

%T 589,859,724,1583,2307,1945,4252,6197,10449,8323,18772,27095,45867,

%U 36481,82348,118829,201177,160003,361180,521183,882363,701773,1584136,2285909

%N a(0)=a(1)=a(2) = 1. a(n) = (a(n-1) +a(n-2)) /GCD(a(n-1)+a(n-2),a(n-3)), for n >= 3.

%t f[l_List] := Append[l, (l[[ -1]] + l[[ -2]])/GCD[l[[ -1]] + l[[ -2]], l[[ -3]]]];Nest[f, {1, 1, 1}, 46] (* _Ray Chandler_, Oct 17 2006 *)

%K nonn

%O 0,4

%A _Leroy Quet_, Oct 10 2006

%E Extended by _Ray Chandler_, Oct 17 2006

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 April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)