This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214283 Smallest Euler characteristic of a downset on an n-dimensional cube. 8
 0, -1, -2, -3, -4, -10, -20, -35, -56, -126, -252, -462, -792, -1716, -3432, -6435, -11440, -24310, -48620, -92378, -167960, -352716, -705432, -1352078, -2496144, -5200300, -10400600, -20058300, -37442160, -77558760, -155117520, -300540195 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS An m-downset is a set of subsets of 1..m such that if S is in the set, so are all subsets of S.  The Euler characteristic of a downset is the number of sets in the downset with an even cardinality, minus the number with an odd cardinality. a(n) = A214282(n) - A001405(n). - Reinhard Zumkeller, Jul 14 2012 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..1000 Terry Tao, Optimal bounds for an alternating sum on a downset, 2012. FORMULA a(n=2k) = -binomial(n-1,n/2) = -binomial(2k-1,k), a(n=4k+3) = -binomial(n-1,(n-1)/2) = -binomial(4k+2,2k+1), a(n=4k+1) = -binomial(n-1,(n+1)/2) = -binomial(4k,2k+1). For n > 1: a(n) = - A007318(n-1, A004525(n)). - Reinhard Zumkeller, Jul 14 2012 a(n+1) = -A000108(n/2) * A212831(n). - Paul Curtz, Nov 04 2012 MATHEMATICA A212831[n_] := (1/4)*((-(1+(-1)^n))*(-1+(-1)^Floor[n/2]) - (-3+(-1)^n)*n); a[n_] := -CatalanNumber[Floor[(n-1)/2]]*A212831[n-1]; Table[a[n], {n, 1, 32}] (* Jean-François Alcover, Nov 06 2012, after Paul Curtz *) PROG (PARI) a(n)=-binomial(n-1, if(n%2, if(n%4==3, n-1, n+1), n)/2) \\ Charles R Greathouse IV, Jul 10 2012 (Haskell) a214283 1 = 0 a214283 n = - a007318 (n - 1) (a004525 n) -- Reinhard Zumkeller, Jul 14 2012 CROSSREFS Cf. A214282. Sequence in context: A306107 A229545 A085932 * A135056 A132135 A131871 Adjacent sequences:  A214280 A214281 A214282 * A214284 A214285 A214286 KEYWORD sign AUTHOR Terence Tao, Jul 09 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 23 21:57 EDT 2019. Contains 328373 sequences. (Running on oeis4.)