This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A058961 Number of possible sets {sum(T) : T contained in S}, where S is a multiset of elements of Z/nZ. 0
 1, 2, 4, 8, 16, 22, 50, 65, 108, 163, 282, 343 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For purposes of computing further terms, note that it suffices to consider multisets S having at most n-1 elements. LINKS EXAMPLE Consider n = 3; then the multiset {0} has 0 as the sum of any subset; {1} has a subset with sum 0 (the empty set) and one with sum 1; {2} has one with sum 0 and one with sum 2; {1,1} has sums 0, 1 and 2 represented. Thus {0}, {0,1}, {0,2}, {0,1,2} are possible values for the set of subset sums (mod 3). Conversely, any S has a subset whose sum is 0 (viz. the empty set), so these are all the possible sets of subset sums; there are 4 of them. Note that n = 6 is the smallest value for which there exists a subset of Z/nZ, containing 0, which is not a set of subset sums. CROSSREFS Sequence in context: A257350 A257165 A262224 * A130917 A007612 A112395 Adjacent sequences:  A058958 A058959 A058960 * A058962 A058963 A058964 KEYWORD nonn AUTHOR Gabriel D. Carroll (gastropodc(AT)hotmail.com), Jan 13 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 17 18:24 EST 2019. Contains 329241 sequences. (Running on oeis4.)