Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121269
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121269 Number of maximal sum-free subsets of {1,2,...,n}. +0
1
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; listen)
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 this_sequence A056219 A085140 A138883

Adjacent sequences: A121266 A121267 A121268 this_sequence A121270 A121271 A121272

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research