github.com/mattn/anko@v0.1.10/_example/scripts/fib-recursion.ank (about)

     1  #!anko
     2  
     3  func fib(n) {
     4    if n == 1 {
     5      return [1]
     6    } else if n == 2 {
     7        return [1,1]
     8    } else {
     9      t = fib(n-1)
    10      return t + (t[len(t)-1] + t[len(t)-2])
    11    }
    12  }
    13  
    14  println(fib(20))