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).

This page as a plain text file.
%I A035042 #21 Sep 04 2017 02:32:07
%S A035042 0,0,0,0,0,0,0,0,0,0,1,12,79,378,1471,4944,14893,41226,106762,262144,
%T A035042 616666,1401292,3096514,6690448,14198086,29703676,61450327,126025204,
%U A035042 256737233,520381366,1050777737,2115862624,4251885323,8531819446
%N A035042 a(n) = 2^n - C(n,0)- ... - C(n,9).
%D A035042 J. Eckhoff, Der Satz von Radon in konvexen Productstrukturen II, Monat. f. Math., 73 (1969), 7-30.
%H A035042 Reinhard Zumkeller, <a href="/A035042/b035042.txt">Table of n, a(n) for n = 0..1000</a>
%F A035042 G.f.: x^10/((1-2*x)*(1-x)^10).
%p A035042 a:=n->sum(binomial(n,j),j=10..n): seq(a(n), n=0..33); # _Zerinvary Lajos_, Jan 04 2007
%t A035042 Table[2^n-Sum[Binomial[n,i],{i,0,9}],{n,0,40}] (* _Harvey P. Dale_, Jan 05 2013 *)
%o A035042 (Haskell)
%o A035042 a035042 n = a035042_list !! n
%o A035042 a035042_list = map (sum . drop 10) a007318_tabl
%o A035042 -- _Reinhard Zumkeller_, Jun 20 2015
%Y A035042 a(n)= A055248(n, 10). Partial sums of A035041.
%Y A035042 Cf. A000079, A000225, A000295, A002663, A002664, A035038-A035041.
%Y A035042 Cf. A007318.
%K A035042 nonn,easy
%O A035042 0,12
%A A035042 _N. J. A. Sloane_