login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204064 G.f.: Sum_{n>=0} x^n * Product_{k=1..n} (k + n*x) / (1 + k*x + n*x^2). 8

%I

%S 1,1,2,5,14,44,152,572,2324,10124,47012,231572,1204964,6599444,

%T 37924292,228033332,1431128804,9354072404,63548071172,447923400692,

%U 3270361265444,24696229801364,192625876675652,1549890430643252,12849460733123684,109647468132256724

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

%C Compare to the identity:

%C Sum_{n>=0} x^n * Product_{k=1..n} (k + x) / (1 + k*x + x^2) = (1+x^2)/(1-x).

%C Compare to the g.f. of A187741:

%C Sum_{n>=0} x^n * (1 + n*x)^n / (1 + x + n*x^2)^n = 1/2 + (1+2*x)*Sum_{n>=0} (n+1)!*x^(2*n)/2.

%H Alois P. Heinz, <a href="/A204064/b204064.txt">Table of n, a(n) for n = 0..597</a>

%F G.f.: 1/2 + Sum_{n>=1} n!/2 * x^(n-1) * (1+x)^n / Product_{k=1..n} (1 + k*x). - _Paul D. Hanna_, Oct 27 2013

%F a(n) = A229046(n+1)/2 for n>0.

%F a(n) = (1/2)*Sum_{k=0..floor((n+1)/2)} Sum_{i=0..k} (-1)^i * C(k,i) * (k-i+1)^(n-k+1) for n>1. (See Paul Barry's formula in A105795). - _Paul D. Hanna_, Jul 13 2014

%e G.f.: A(x) = 1 + x + 2*x^2 + 5*x^3 + 14*x^4 + 44*x^5 + 152*x^6 + 572*x^7 +...

%e where

%e A(x) = 1 + x*(1+x)/(1+x+x^2) + x^2*(1+2*x)*(2+2*x)/((1+x+2*x^2)*(1+2*x+2*x^2)) + x^3*(1+3*x)*(2+3*x)*(3+3*x)/((1+x+3*x^2)*(1+2*x+3*x^2)*(1+3*x+3*x^2)) + x^4*(1+4*x)*(2+4*x)*(3+4*x)*(4+4*x)/((1+x+4*x^2)*(1+2*x+4*x^2)*(1+3*x+4*x^2)*(1+4*x+4*x^2)) +...

%e Also, we have the identity (cf. A229046):

%e A(x) = 1/2 + (1/2)*(1+x)/(1+x) + (2!/2)*x*(1+x)^2/((1+x)*(1+2*x)) + (3!/2)*x^2*(1+x)^3/((1+x)*(1+2*x)*(1+3*x)) + (4!/2)*x^3*(1+x)^4/((1+x)*(1+2*x)*(1+3*x)*(1+4*x)) + (5!/2)*x^4*(1+x)^5/((1+x)*(1+2*x)*(1+3*x)*(1+4*x)*(1+5*x)) +...

%p b:= proc(n, k) option remember; `if`(n<1, 1, `if`(k>

%p ceil(n/2), 0, add((k-j)*b(n-1-j, k-j), j=0..1)))

%p end:

%p a:= n-> ceil(add(b(n+2, k), k=1..1+ceil(n/2))/2):

%p seq(a(n), n=0..25); # _Alois P. Heinz_, Jan 26 2018

%t b[n_, k_] := b[n, k] = If[n < 1, 1, If[k > Ceiling[n/2], 0, Sum[(k - j) b[n - 1 - j, k - j], {j, 0, 1}]]];

%t a[n_] := Ceiling[Sum[b[n + 2, k], {k, 1, 1 + Ceiling[n/2]}]/2];

%t Table[a[n], {n, 0, 25}] (* _Jean-Fran├žois Alcover_, Jun 05 2018, after _Alois P. Heinz_ *)

%o (PARI) {a(n)=polcoeff( sum(m=0, n, x^m*prod(k=1,m,(k+m*x)/(1+k*x+m*x^2 +x*O(x^n))) ), n)}

%o for(n=0, 30, print1(a(n), ", "))

%o (PARI) {a(n)=polcoeff( 1/2 + sum(m=1, n+1, m!/2*x^(m-1)*(1+x)^m/prod(k=1, m, 1+k*x +x*O(x^n))), n)}

%o for(n=0,30,print1(a(n),", "))

%o (PARI) {a(n)=if(n<0,0,if(n<1,1,(1/2)*sum(k=0, floor((n+1)/2), sum(i=0, k, (-1)^i*binomial(k, i)*(k-i+1)^(n-k+1)))))} \\ Paul D. Hanna, Jul 13 2014

%o for(n=0, 30, print1(a(n), ", "))

%Y Cf. A229046, A204066, A187741, A187742, A220181.

%K nonn

%O 0,3

%A _Paul D. Hanna_, Jan 09 2013

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 September 21 19:57 EDT 2020. Contains 337273 sequences. (Running on oeis4.)