Write a program to output the nth fibonacci number in quinary
Python, 226 bytes
s='s=%r;a,b=0,1;exec&quot;a,b=b,a+b;&quot;*input();print&quot;&quot;.join(map(lambda i:(s%%s)*int(i)+(s%%s)[::-1]*(1-int(i)),bin(a)[2:]))';a,b=0,1;exec&quot;a,b=b,a+b;&quot;*input();print&quot;&quot;.join(map(lambda i:(s%s)*int(i)+(s%s)[::-1]*(1-int(i)),bin(a)[2:]))

It's quite a heavy modification to the standard Python Quine. It uses a,b=0,1;exec&quot;a,b=b,a+b;&quot; to generate Fibonacci numbers.