login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035042 a(n) = 2^n - C(n,0)- ... - C(n,9). 13

%I #21 Sep 04 2017 02:32:07

%S 0,0,0,0,0,0,0,0,0,0,1,12,79,378,1471,4944,14893,41226,106762,262144,

%T 616666,1401292,3096514,6690448,14198086,29703676,61450327,126025204,

%U 256737233,520381366,1050777737,2115862624,4251885323,8531819446

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

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

%H Reinhard Zumkeller, <a href="/A035042/b035042.txt">Table of n, a(n) for n = 0..1000</a>

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

%p a:=n->sum(binomial(n,j),j=10..n): seq(a(n), n=0..33); # _Zerinvary Lajos_, Jan 04 2007

%t Table[2^n-Sum[Binomial[n,i],{i,0,9}],{n,0,40}] (* _Harvey P. Dale_, Jan 05 2013 *)

%o (Haskell)

%o a035042 n = a035042_list !! n

%o a035042_list = map (sum . drop 10) a007318_tabl

%o -- _Reinhard Zumkeller_, Jun 20 2015

%Y a(n)= A055248(n, 10). Partial sums of A035041.

%Y Cf. A000079, A000225, A000295, A002663, A002664, A035038-A035041.

%Y Cf. A007318.

%K nonn,easy

%O 0,12

%A _N. J. A. Sloane_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 08:27 EDT 2024. Contains 371698 sequences. (Running on oeis4.)