Your skill will accomplish what the force of many cannot 

PerlMonks 
Re^4: Fibonacci numbers (again)by ambrus (Abbot) 
on Sep 09, 2005 at 11:28 UTC ( #490517=note: print w/replies, xml )  Need Help?? 
It's all just convention, but I opt for 0,1,1,2,3,5,..., and I have a reason. If you define F_0 = 0, F_1 = 1, than the nice equation gcd(F_n, F_k) = F_{gcd(n,k)} is true, and as a special case F_k divides F_n iff k divides n. This nice equation would be much more ugly if F_0 != 0.
Update 2006 nov 4: the above paragraph is false. Sorry.
In Section
Obfuscated Code

