Is there a better code for printing fibonacci series?

Also to have a more efficient way to calculate Go if you watch closely, you'll see the following sequence:

1 1 2 3 5 8 13 21 34 55 89 144 ...

The formula for mapping the Fibonacci sequence is:

Then if you code this (Go):

package main

import "fmt"

func fibonacci() func() int {
    first, second := 0, 1
    return func() int {
        ret := first
        first, second = second, first+second
        return ret
    }
}

func main() {
    f := fibonacci()
    for i := 0; i < 100; i++ {
        fmt.Println(f())
    }
}

You'll see the numbers till 100 and without using conditionals for base cases. I hope that approach helped you understand better the problem!

Cheers!