Problem 42248. Return fibonacci sequence do not use loop and condition version 3

 f  = fib(n)

 f() = 2

 f() = 3

 f() = 5

 f() = 13

 f() = 21

 f() = 34

Solution Comments

Problem Recent Solvers13

Suggested Problems

• De-dupe

  3985 Solvers

• Determine if a Given Number is a Triangle Number

  402 Solvers

• Project Euler: Problem 8, Find largest product in a large string of numbers

  1333 Solvers

• Return elements unique to either input

  818 Solvers

• Sum of odd numbers in a matrix

  624 Solvers

More from this Author17

• Return fibonacci sequence do not use loop and condition

  879 Solvers

• Determine if input is a perfect number

  267 Solvers

• Make an anonymous function that has variable output

  33 Solvers

• Return fibonacci sequence do not use loop and condition version 2

  64 Solvers

• Project Euler: Problem 14 Longest Collatz sequence(harder version)

  5 Solvers