login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325865 Number of maximal subsets of {1..n} of which every subset has a different sum. 9
1, 1, 1, 3, 3, 6, 14, 23, 27, 40, 64, 104, 180, 275, 399, 554, 679, 872 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
EXAMPLE
The a(1) = 1 through a(6) = 14 subsets:
{1} {1,2} {1,2} {1,3} {1,2,4} {1,2,4}
{1,3} {1,2,4} {1,2,5} {1,2,5}
{2,3} {2,3,4} {1,3,5} {1,2,6}
{2,3,4} {1,3,5}
{2,4,5} {1,3,6}
{3,4,5} {1,4,6}
{2,3,4}
{2,3,6}
{2,4,5}
{2,5,6}
{3,4,5}
{3,4,6}
{3,5,6}
{4,5,6}
MATHEMATICA
fasmax[y_]:=Complement[y, Union@@(Most[Subsets[#]]&)/@y];
Table[Length[fasmax[Select[Subsets[Range[n]], UnsameQ@@Plus@@@Subsets[#]&]]], {n, 0, 10}]
CROSSREFS
Sequence in context: A096572 A318540 A325879 * A110523 A145597 A143418
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jun 01 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)