Shortest code - Finding the kth good cipher
Perl, 75 74 characters

map{map{1while++$n=~/[13579]|(.+)(?(?{$^N&lt;1|$^N%11})!)/}1..&lt;&gt;;$n=say$n}1..&lt;&gt;


I should point out that the character count is taking advantage of Perl's bizarre feature of allowing a special variable of the form $^X to be spelled with a literal ctrl-X character.

The regex extensions being utilized are also terrifying, but boy do they come in handy.