|
Search: id:A104185
|
|
|
| A104185 |
|
Number of partitions of the set 1, 2, 3, ..., 6n+3 into 2n+1 sets of 3 elements each, such that each 3-element set has the same sum (there are no such partitions unless there are 6n+3 elements). |
|
+0
1
|
| |
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
Dossey, Giordano, McCrone, and Weir, Mathematics methods and modeling for today's mathematics classroom, p. 134
|
|
LINKS
|
Michael Paul Goldenberg, Online discussion
|
|
EXAMPLE
|
a(1) = 2 because with 9 elements they can be partitioned (9 5 1) (8 4 3) (7 6 2) or (9 4 2) (8 6 1) (7 5 3)
|
|
PROGRAM
|
Scheme program to generate terms of the sequence available from Joshua Zucker on request.
|
|
CROSSREFS
|
Sequence in context: A056846 A104086 A086406 this_sequence A074604 A135404 A036076
Adjacent sequences: A104182 A104183 A104184 this_sequence A104186 A104187 A104188
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Mar 11 2005
|
|
EXTENSIONS
|
More terms from Guenter Sterten
|
|
|
Search completed in 0.002 seconds
|
