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!)
A006898 a(n) = Sum_{k=0..n} C(n,k)*2^(k*(k+1)/2).
(Formerly M2958)
4

%I M2958 #48 Apr 01 2023 11:04:50

%S 1,3,13,95,1337,38619,2310533,283841911,70927591153,35812691480115,

%T 36383765777442685,74185239630793429775,303119284294591169426729,

%U 2479814853198140771706795531,40599509058360322571947638063605

%N a(n) = Sum_{k=0..n} C(n,k)*2^(k*(k+1)/2).

%C First differences of A006896.

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

%F a(n) ~ 2^(n*(n+1)/2). - _Vaclav Kotesovec_, Nov 27 2017

%t Table[Sum[Binomial[n,k]2^((k(k+1))/2),{k,0,n}],{n,0,20}] (* _Harvey P. Dale_, Apr 01 2023 *)

%o (PARI) a(n)=sum(k=0,n,binomial(n,k)*2^(k*(k+1)/2)) \\ _Paul D. Hanna_, Apr 10 2009

%Y Cf. A006896, A006897, A135748.

%K nonn

%O 0,2

%A _Colin Mallows_

%E Formula and more terms from _Vladeta Jovovic_, Sep 20 2003

%E Edited by _N. J. A. Sloane_, Apr 12 2009 at the suggestion of Vladeta Jovovic

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 25 13:02 EDT 2024. Contains 371969 sequences. (Running on oeis4.)