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!)
A270144 a(n) = Sum_{k=0..n} (-1)^(k+1) * k * A000009(n-k). 3

%I #9 Mar 12 2016 10:45:43

%S 0,1,-1,2,-1,2,0,2,1,2,3,2,5,3,7,5,10,7,14,11,18,17,24,24,32,34,42,47,

%T 56,63,74,85,96,113,126,147,165,191,213,247,275,316,353,404,449,514,

%U 571,648,723,816,909,1024,1140,1278,1424,1592,1770,1976,2195,2442

%N a(n) = Sum_{k=0..n} (-1)^(k+1) * k * A000009(n-k).

%C Convolution of A000009 and A181983.

%H Vaclav Kotesovec, <a href="/A270144/b270144.txt">Table of n, a(n) for n = 0..5000</a>

%F a(n) = Sum_{k=0..n} (-1)^(n-k+1) * (n-k) * A000009(k).

%F a(n) ~ A000009(n)/4.

%F a(n) ~ exp(Pi*sqrt(n/3)) / (16*3^(1/4)*n^(3/4)).

%F G.f.: x/(1+x)^2 * Product_{k>=1} (1+x^k).

%t Table[Sum[(-1)^(n-k+1)*PartitionsQ[k]*(n-k), {k, 0, n}], {n, 0, 100}]

%t nmax = 100; CoefficientList[Series[x/(1 + x)^2 * Product[(1 + x^k), {k, 1, nmax}], {x, 0, nmax}], x]

%Y Cf. A000009, A025147, A095944, A270143.

%K sign

%O 0,4

%A _Vaclav Kotesovec_, Mar 12 2016

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 July 25 09:55 EDT 2024. Contains 374587 sequences. (Running on oeis4.)