login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001315 Sum 2^C(n,k), k = 0..n.
(Formerly M1158 N0441)
13

%I M1158 N0441

%S 2,4,8,20,100,2116,1114244,68723671300,1180735735906024030724,

%T 170141183460507917357914971986913657860

%N Sum 2^C(n,k), k = 0..n.

%D H. W. Gould, Exponential Binomial Coefficient Series. Tech. Rep. 4, Math. Dept., West Virginia Univ., Morgantown, WV, Sep. 1961.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H T. D. Noe, <a href="/A001315/b001315.txt">Table of n, a(n) for n = 0..13</a>

%t Table[Sum[2^Binomial[n, k], {k, 0, n}], {n, 0, 13}] (* _T. D. Noe_, Jun 28 2012 *)

%K nonn

%O 0,1

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 05:11 EST 2019. Contains 329839 sequences. (Running on oeis4.)