Haskell vs JavaScript: find the sum of all odd squares that are smaller than 10000

haskell.hs

sum . takeWhile (<10000) . filter odd . map (^2) $ [1..]

javascript.js

var sum = 0,
    i = 0,
    n = 0;

while ((n = Math.pow(++i, 2)) < 1e4) {
  i % 2 !== 0 && (sum += n);
}

For some context, the constraints I put on myself for the above were to write as close to a single expression as possible in JavaScript, since that's what Haskell is able to do using only the language's standard library.

You could extend JavaScript with libraries to achieve some like the below;

take(1, 10000).map(pow(2)).filter(lt(10000), odd);

But the total code used to create that would be much more.

Ah, that makes sense - I was wondering why the JS equivalent looked quite convoluted! :)