{"push_id":928286002,"size":1,"distinct_size":1,"ref":"refs/heads/InterviewQuestions","head":"d9c9c4eb6fdaa2bb0ce04805532e75b5f25aa073","before":"21833b47b4b13739ac209061e3d53c716e8e42a1","commits":[{"sha":"d9c9c4eb6fdaa2bb0ce04805532e75b5f25aa073","author":{"email":"135302c1613a1b9f97bfb9b569de6a4408a0d9b6@gmail.com","name":"Varun"},"message":"DisguisedSequence\n\n## Given u0 = 1, u1 = 2 and the relation 6unun+1-5unun+2+un+1un+2 = 0\ncalculate un for any integer n >= 0.\n\n## Examples\n\n## fct(n) returns un: fct(17) -> 131072, fct(21) -> 2097152\n\n## Remark: You can take two points of view to do this kata:\n\n## the first one purely algorithmic from the definition of un\n## the second one - not at all mandatory, but as a complement - is to\n## get a bit your head around and find which sequence is hidden behind\nun.","distinct":true,"url":"https://api.github.com/repos/varunpappu/PracticeFunctions/commits/d9c9c4eb6fdaa2bb0ce04805532e75b5f25aa073"}]}