Output the Iccanobif Sequence
Python 2, 58 bytes



a=0;b=1
exec"print a;a,b=b,int(str(a+b)[::-1]);"*-~input()


Uses str to convert rather than backticks because large enough numbers in Python 2 are written with an L at the end. I tried a recursive function, but it turned out longer (61):

f=lambda n,a=0,b=1:-~n*[0]and[a]+f(n-1,b,int(str(a+b)[::-1]))