Let u(n,k) be the recursion defined by u(n,1)=1, u(n,2)=2, u(n,3)=n, and u(n,k+3) = (u(n,k+2) + u(n,k+1))/u(n,k) if u(n,k) divides u(n,k+2) + u(n,k+1), u(n,k+3) = u(n,k) otherwise. Then u(n,k) is periodic and a(n) = Max(u(n,k), k >= 1).

A069214

Let u(n,k) be the recursion defined by u(n,1)=1, u(n,2)=2, u(n,3)=n, and u(n,k+3) = (u(n,k+2) + u(n,k+1))/u(n,k) if u(n,k) divides u(n,k+2) + u(n,k+1), u(n,k+3) = u(n,k) otherwise. Then u(n,k) is periodic and a(n) = Max(u(n,k), k >= 1).

Terms

    a(0) =5a(1) =4a(2) =5a(3) =6a(4) =8a(5) =8a(6) =11a(7) =10a(8) =14a(9) =12a(10) =17a(11) =14a(12) =20a(13) =16a(14) =23a(15) =18a(16) =26a(17) =20a(18) =29a(19) =22a(20) =32a(21) =24a(22) =35a(23) =26a(24) =38a(25) =28a(26) =41a(27) =30a(28) =44a(29) =32

External references