The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A325878 Number of maximal subsets of {1..n} such that every orderless pair of distinct elements has a different sum. 13
 1, 1, 1, 1, 4, 5, 8, 22, 40, 56, 78, 124, 222, 390, 616, 892, 1220, 1620, 2182, 3042, 4392 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS EXAMPLE The a(1) = 1 through a(6) = 8 subsets:   {1}  {1,2}  {1,2,3}  {1,2,3}  {1,2,4}    {1,2,3,5}                        {1,2,4}  {2,3,4}    {1,2,3,6}                        {1,3,4}  {2,4,5}    {1,2,4,6}                        {2,3,4}  {1,2,3,5}  {1,3,4,5}                                 {1,3,4,5}  {1,3,5,6}                                            {1,4,5,6}                                            {2,3,4,6}                                            {2,4,5,6} MATHEMATICA fasmax[y_]:=Complement[y, Union@@(Most[Subsets[#]]&/@y)]; Table[Length[fasmax[Select[Subsets[Range[n]], UnsameQ@@Plus@@@Subsets[Union[#], {2}]&]]], {n, 0, 10}] CROSSREFS The subset case is A196723. The maximal case is A325878. The integer partition case is A325857. The strict integer partition case is A325877. Heinz numbers of the counterexamples are given by A325991. Cf. A002033, A108917, A143823, A143824, A276024. Cf. A325858, A325859, A325864, A325865, A325867, A325879, A325880. Sequence in context: A275929 A240794 A171938 * A072808 A104884 A226795 Adjacent sequences:  A325875 A325876 A325877 * A325879 A325880 A325881 KEYWORD nonn,more AUTHOR Gus Wiseman, Jun 02 2019 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 April 3 01:50 EDT 2020. Contains 333195 sequences. (Running on oeis4.)