Daily Challenge #65- A Disguised Sequence

thepracticaldev profile image dev.to staff ・1 min read

Given u0 = 1, u1 = 2 and the relation 6unun+1-5unun+2+un+1un+2 = 0 calculate un for any integer n >= 0.

fcn(n) returns un: fcn(17) -> 131072, fcn(21) -> 2097152

You can look at this as

-Purely algorithmic from the definition of u^n
-the second one - not at all mandatory, but as a compliment - is to get a bit your head around and find which sequence is hidden behind u^n

This challenge comes from g964 at CodeWars, who has licensed redistribution of this challenge under the 2-Clause BSD License!

Want to propose a challenge idea for a future post? Email yo+challenge@dev.to with your suggestions!

Posted on by:

thepracticaldev profile

dev.to staff


The hardworking team behind dev.to ❤️


markdown guide

for others not understanding the task, check out the link to the original: codewars.com/kata/563f0c54a22b9345...

6unun+15unun+2+un+1un+2=0 6u_n u_{n+1} - 5 u_n u_{n+2} + u_{n+1} u_{n+2}= 0

I didn't understand the recurrence relation. Is 6unun == 6*un*un?