|
Search: id:A070880
|
|
|
| A070880 |
|
Let m = number of ways of partitioning n into parts using the all parts of a subset of {1, 2, ..., n-1}; a(n) gives number of different subsets of {1, 2, ..., n-1} whose m is 0. |
|
+0
2
|
|
| 0, 0, 1, 3, 10, 22, 52, 110, 234, 482, 987, 1997, 4035, 8113, 16288, 32644, 65388, 130886, 261922
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
