I was inspired to do this when reading about Almost Integers and thought I would try something sort of similar. Here I wrote a small code that finds the best representation of E as a sum of inverse powers of Pi with integer coefficients. It just brute force searches over all combinations of integer coefficients in a small range. If anyone else wants to play around with it here it is:
```
maxPower = 5;
pTab = Table[ Pi^-i, {i, 0, maxPower}];
err[inp_] := Abs[inp . pTab - E];
maxInteger = 4;
tups = Tuples[Range[-maxInteger, maxInteger], maxPower + 1];
```
maxPower = 5;
pTab = Table[ Pi^-i, {i, 0, maxPower}];
err[inp_] := Abs[inp . pTab - E];
maxInteger = 4;
tups = Tuples[Range[-maxInteger, maxInteger], maxPower + 1];