Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with integer-sequences
Search options not deleted
user 179006
For questions about sequences of integers. References are often made to the online resource oeis.org.
4
votes
What is the smallest size of a shape in which all fixed $n$-polyominos can fit?
Proof outline for $\Omega(n^{2-\varepsilon})$
Choose a positive integer $k$ which will determine that $\varepsilon=\frac{1}{k}$.
Now consider the problem of embedding the 1 dimensional $k$-block shape …
- 141