I was inspired by your exploits with lambda calculus and decided to write my first recursive method in Ruby!
Project Euler #14 seemed like the perfect problem to start with:
The following iterative sequence is defined for the set of positive integers:
n → n/2 (n is even) n → 3n + 1 (n is odd)