|
Search: id:A131752
|
|
|
| A131752 |
|
Number of ways of choosing the largest subset of {1,2,...,n} such that no two distinct elements differ by a perfect square. |
|
+0
4
|
|
| 1, 2, 4, 7, 10, 16, 24, 36, 56, 76, 112, 160
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
