Say Hello to the Pioneers of Computer Science
CJam, 230 117 115 114 113 110 107 106 bytes * 13 = 1378

23)3*c11(2#)c111(((c3*))))22 2*c32c23 3*c3))$(113))c1$)))2$)2$(32c3)))$(3)$))1($)1($)3))$)1($)1$(12$(((33c


Test it here.

I chose Edsger Dijkstra, born 1930, which gives me c#2&amp;$1&gt;b()* 3 (whom I really just chose because he was the first one I found whose name yielded useful characters for CJam; I've checked a dozen names since and none looked as promising).

The code basically just builds the ASCII codes using 1, 2, 3, *, # (exponentiation) and (, ) (decrement, increment) and converts them to a character with c. To save some characters I can sometimes copy an earlier character with $ (0$ copies the top stack element, 1$ copies the second-to-top stack element and so on).

Here is the breakdown of the code into characters (this is also runnable):

23)3*c    "(23+1)*3 -&gt; 72 -&gt; H";
11(2#)c   "(11-1)^2+1 -&gt; 101 -&gt; e";
111(((c   "111-3 -&gt; 108 -&gt; l";
3*)       "Turn l into string lll and split off the third l.";
)))       "l+3 -&gt; o";
22 2*c    "22*2 -&gt; 44 -&gt; ,";
32c       "32 -&gt; Space";
23 3*c    "23*3 -&gt; 69 -&gt; E";
3))$(     "e-1 -&gt; d";
113))c    "113+2 -&gt; 115 -&gt; s";
1$)))     "d+3 -&gt; g";
2$)       "d+1 -&gt; e";
2$(       "s+1 -&gt; r";
32c       "32 -&gt; Space";
3)))$(    "E-1 -&gt; D";
3)$))     "g+2 -&gt; i";
1($)      "i+1 -&gt; j";
1($)      "j+1 -&gt; k";
3))$)     "r+1 -&gt; s";
1($)      "s+1 -&gt; t";
1$(       "s-1 -&gt; r";
12$(((    "d-3 -&gt; a";
33c       "33 -&gt; !";