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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085489 a(n) = number of subsets of {1,...,n} containing no solutions to x+y=z with x and y distinct (one version of "sum-free subsets"). 6
2, 4, 7, 13, 22, 37, 61, 102, 162, 261, 410, 646, 1001, 1553, 2370, 3645, 5515, 8303, 12470, 18713, 27811, 41244, 60962, 89733, 131870, 192522, 281125, 408680, 593880, 855661, 1238592, 1779614, 2563476, 3660084, 5255913, 7473380, 10696444, 15137517 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Eric Weisstein's World of Mathematics, Sum-Free Set [Strictly speaking this link is not relevant, since it uses a different definition of "sum-free".]

FORMULA

a(n) = 2^n - A088809(n). - Reinhard Zumkeller, Oct 19 2003

CROSSREFS

See A007865 for another version.

Sequence in context: A119983 A151897 A192758 * A101268 A188920 A128768

Adjacent sequences:  A085486 A085487 A085488 * A085490 A085491 A085492

KEYWORD

nonn,nice

AUTHOR

Eric Weisstein (eric(AT)weisstein.com), Jul 02, 2003

EXTENSIONS

More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 13 2003

Edited by David Wasserman (dwasserm(AT)earthlink.net), Apr 16 2008

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 17 14:19 EST 2012. Contains 206038 sequences.