- \ Q(n) = Q(n - Q(n-2)) + Q(n - Q(n-1)) 
- \ 76 bytes 
-   
- : Q recursive dup dup 3 < if - 1+ else 2dup 2 - Q - Q -rot 1- Q - Q + then ; 
-   
-   
- : f 16 1 DO  
- 	I Q . 
- LOOP ; f 
				XCBRKG4pID0gUShuIC0gUShuLTIpKSArIFEobiAtIFEobi0xKSkKXCA3NiBieXRlcwoKOiBRIHJlY3Vyc2l2ZSBkdXAgZHVwIDMgPCBpZiAtIDErIGVsc2UgMmR1cCAyIC0gUSAtIFEgLXJvdCAxLSBRIC0gUSArIHRoZW4gOwoKCjogZiAxNiAxIERPIAoJSSBRIC4KTE9PUCA7IGY=