|
Search: id:A112956
|
|
|
| A112956 |
|
a(n) = number of ways the set {1,2,...,n} can be split into proper subsets with equal sums. |
|
+0
2
|
|
| 0, 0, 1, 1, 1, 1, 5, 11, 10, 1, 79, 165, 1, 664, 2917, 3308, 9295, 23729
(list; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
COMMENT
|
For n=7 we have splittings 761/5432, 752/6431, 743/6521, 7421/653 and 7/61/52/43 so a(7)=5.
|
|
FORMULA
|
a(n) = A035470(n) - 1. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 02 2006
|
|
CROSSREFS
|
Cf. A035470.
Sequence in context: A082952 A113964 A075261 this_sequence A061768 A060846 A113002
Adjacent sequences: A112953 A112954 A112955 this_sequence A112957 A112958 A112959
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Floor van Lamoen (fvlamoen(AT)hotmail.com), Oct 07 2005
|
|
EXTENSIONS
|
More terms from Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 02 2006
|
|
|
Search completed in 0.002 seconds
|
