|
Search: id:A131753
|
|
|
| A131753 |
|
Number of ways of choosing the largest subset of {1,2,...,n} such that no two distinct elements differ by a perfect square > 1. |
|
+0
4
|
|
| 1, 3, 7, 15, 23, 35, 53, 80, 134, 188, 266, 376
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
