But at 47 characters I think MeowChow still won't be beat:

sub sieve {
  sub p{$_[0],@_>1?p(grep$_%$_[0],@_):()}p 2..pop
}
[download]

I had thought of that, but assumed it would slide :)

Make that 46 by the way...

sub sieve {
  sub p{$_[0],$#_?p(grep$_%$_[0],@_):()}p 2..pop
}
[download]

   MeowChow                                   
               s aamecha.s a..a\u$&owag.print

I had thought of that, but that goes into deep recursion if you call sieve(1). :)

Oh, but tilly says that you may assume $n is above a fixed number. Pooh!

Abusing the rules for fun and profit (46 chars):

sub sieve {
  sub p{$_[0],@_>1?p(grep$_%$_[0],@_):1}p 2..pop
}
[download]

   MeowChow                                   
               s aamecha.s a..a\u$&owag.print

Of course the bonus question is still wide open...