Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085489
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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"). +0
7
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; listen)
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 (reinhard.zumkeller(AT)gmail.com), Oct 19 2003

CROSSREFS

See A007865 for another version.

Sequence in context: A143823 A119983 A151897 this_sequence A101268 A128768 A001036

Adjacent sequences: A085486 A085487 A085488 this_sequence 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

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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research