Shortest code to write longest code
perl/perl, unlimited score under original rule with unlimited range

Here's some code which doesn't win:

$l=-2**5-1;
$h=2**5;
sub p{print@_}
p"sub add {(\$i,\$j)=\@_;\n";
for($i=$l;$i&lt;=$h;++$i){
  for ($j=$l;$j&lt;=$h;++$j){
    p" return ".($i*$j)." if (\$i == $i) &amp;&amp; (\$j == $j);\n";
  }
}
p"}print add(&lt;&gt;,&lt;&gt;)\n";


The output has this form:

sub add {($i,$j)=@_;
 return 1089 if ($i == -33) &amp;&amp; ($j == -33);
 return 1056 if ($i == -33) &amp;&amp; ($j == -32);
 return 1023 if ($i == -33) &amp;&amp; ($j == -31);
 return 990 if ($i == -33) &amp;&amp; ($j == -30);
...
 return 928 if ($i == 32) &amp;&amp; ($j == 29);
 return 960 if ($i == 32) &amp;&amp; ($j == 30);
 return 992 if ($i == 32) &amp;&amp; ($j == 31);
 return 1024 if ($i == 32) &amp;&amp; ($j == 32);
}print add(&lt;&gt;,&lt;&gt;)


the output file is 181030 bytes long, but after stripping spaces and newlines, it is only 133109 bytes long. so, the score is 133109/248 = 536.7289...

Here's some other code that doesn't win - it is the same program except the first 2 lines:

$l=-2**6-1;
$h=2**6;


the output file is 718138 bytes long, but after stripping spaces and newlines, it is only 532233 bytes long. so, the score is 532233/248 = ~2146. better! using 7 yields a score of ~8750, 8 yields ~35347, 9 yields ~149129, 10 yields 151100000 non-space / 250 = 604,400 ....

of course we can do this as long as we want. the size of the source program, n, will increase as O(log(n)). the size of the output program is O(2*n). The limit of 2*n/log(n) as n goes to infinity is clearly infinity, so if I just substitute in my favorite large number, a googolplex, I win (until someone suggests googolplex+1).