cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A035042 a(n) = 2^n - C(n,0)- ... - C(n,9).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 12, 79, 378, 1471, 4944, 14893, 41226, 106762, 262144, 616666, 1401292, 3096514, 6690448, 14198086, 29703676, 61450327, 126025204, 256737233, 520381366, 1050777737, 2115862624, 4251885323, 8531819446
Offset: 0

Views

Author

Keywords

References

  • J. Eckhoff, Der Satz von Radon in konvexen Productstrukturen II, Monat. f. Math., 73 (1969), 7-30.

Crossrefs

a(n)= A055248(n, 10). Partial sums of A035041.
Cf. A007318.

Programs

  • Haskell
    a035042 n = a035042_list !! n
    a035042_list = map (sum . drop 10) a007318_tabl
    -- Reinhard Zumkeller, Jun 20 2015
  • Maple
    a:=n->sum(binomial(n,j),j=10..n): seq(a(n), n=0..33); # Zerinvary Lajos, Jan 04 2007
  • Mathematica
    Table[2^n-Sum[Binomial[n,i],{i,0,9}],{n,0,40}] (* Harvey P. Dale, Jan 05 2013 *)

Formula

G.f.: x^10/((1-2*x)*(1-x)^10).