1.3 KiB
1.3 KiB
id | challengeType | title |
---|---|---|
5900f41a1000cf542c50ff2d | 5 | Problem 174: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements |
Description
If t represents the number of tiles used, we shall say that t = 8 is type L(1) and t = 32 is type L(2). Let N(n) be the number of t ≤ 1000000 such that t is type L(n); for example, N(15) = 832. What is ∑ N(n) for 1 ≤ n ≤ 10?
Instructions
Tests
tests:
- text: <code>euler174()</code> should return 209566.
testString: assert.strictEqual(euler174(), 209566, '<code>euler174()</code> should return 209566.');
Challenge Seed
function euler174() {
// Good luck!
return true;
}
euler174();
Solution
// solution required