|
Search: id:A050291
|
|
|
| A050291 |
|
Number of double-free subsets of {1, 2, ..., n}. |
|
+0
11
|
|
| 2, 3, 6, 10, 20, 30, 60, 96, 192, 288, 576, 960, 1920, 2880, 5760, 9360, 18720, 28080, 56160, 93600, 187200, 280800, 561600, 898560, 1797120, 2695680, 5391360, 8985600, 17971200, 26956800, 53913600, 87091200, 174182400, 261273600
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
A set is double-free if it does not contain both x and 2x.
|
|
REFERENCES
|
Wang, E. T. H. ``On Double-Free Sets of Integers.'' Ars Combin. 28, 97-100, 1989.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..400
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
FORMULA
|
a(n+1)=a(n)*Fib(b(2n)+2)/Fib(b(2n)+1), Fib = A000045, b = A007814.
a(n) = 2^n - A088808(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 19 2003
|
|
CROSSREFS
|
Cf. A050292-A050296.
Sequence in context: A005833 A001678 A113292 this_sequence A135452 A077027 A030436
Adjacent sequences: A050288 A050289 A050290 this_sequence A050292 A050293 A050294
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com)
|
|
EXTENSIONS
|
Extended with formula by Christian G. Bower (bowerc(AT)usa.net), Sep 15 1999
|
|
|
Search completed in 0.002 seconds
|
