login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121269 Number of maximal sum-free subsets of {1,2,...,n}. 0
1, 2, 2, 4, 5, 6, 8, 13, 17, 23, 29, 37, 51, 66, 86, 118, 158, 201, 265, 359, 471, 598, 797, 1043, 1378, 1765, 2311, 3064, 3970, 5017, 6537, 8547, 11020, 14007, 18026, 23404, 30026, 37989, 48945, 62759, 80256 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

N. Hindman and H. Jordan, Measures of sum-free intersecting families, New York J. Math. 13 (2007), 97-106.

EXAMPLE

a(5)=5 because the maximal sum-free subsets of {1,2,3,4,5} are {1,4}, {2,3}, {2,5}, {1,3,5} and {3,4,5}

CROSSREFS

Sequence in context: A056902 A089676 A062436 * A056219 A085140 A138883

Adjacent sequences:  A121266 A121267 A121268 * A121270 A121271 A121272

KEYWORD

nonn

AUTHOR

N. Hindman (nhindman(AT)aol.com), Aug 23 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.