|
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, 31874, 301029, 422896, 1, 13716866, 71504979, 100664384, 54148590, 880696661, 498017758, 27450476786, 111911522818, 179459955553, 2144502175213, 59115423982
(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.
a(n) = 1 <=> n*(n+1)/2 is product of two primes. [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 03 2009]
|
|
FORMULA
|
a(n) = A035470(n) - 1. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 02 2006
|
|
MAPLE
|
with (numtheory): b:= proc() option remember; local i, j, t; `if` (args[1]=0, `if` (nargs=2, 1, b(args[t] $t=2..nargs)), add (`if` (args[j] -args[nargs] <0, 0, b(sort ([seq (args[i] -`if` (i=j, args[nargs], 0), i=1..nargs-1)])[], args[nargs]-1)), j=1..nargs-1)) end: a:= proc(n) local i, m, x; m:= n*(n+1)/2; add (b(i$(m/i), n)/(m/i)!, i=[select (x-> x>=n, divisors(m) minus {m})[]]) end: seq (a(n), n=1..25); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 03 2009]
|
|
CROSSREFS
|
Cf. A035470.
Cf. A164977, A164978. [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 03 2009]
Sequence in context: A082952 A113964 A075261 this_sequence A157801 A061768 A060846
Adjacent sequences: A112953 A112954 A112955 this_sequence A112957 A112958 A112959
|
|
KEYWORD
|
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
a(19) - a(33) from Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 03 2009
|
|
|
Search completed in 0.002 seconds
|
