|
Search: id:A035470
|
|
|
| A035470 |
|
Number of ways to break {1,2,3,...n} into sets with equal sums. |
|
+0
2
|
|
| 1, 1, 2, 2, 2, 2, 6, 12, 11, 2, 80, 166, 2, 665, 2918, 3309, 9296, 23730
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
a(7)=6 since we have 1234567, 16/25/34/7, 167/2345, 257/1346, 347/1256, 356/1247
|
|
CROSSREFS
|
Sequence in context: A078014 A063867 A024723 this_sequence A061292 A138068 A054083
Adjacent sequences: A035467 A035468 A035469 this_sequence A035471 A035472 A035473
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Erich Friedman (erich.friedman(AT)stetson.edu)
|
|
EXTENSIONS
|
More terms from John W. Layman (layman(AT)math.vt.edu), Mar 18 2002
|
|
|
Search completed in 0.002 seconds
|
