cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 1, 3, 12, 64, 420, 3276, 29581, 303389, 3483053, 44245695, 616103046, 9330961666, 152700926414, 2685132170466, 50488787588936, 1010864433071206, 21470488933116138, 482176661100286182, 11415700804801064258, 284169548252819022230, 7419733139418740010570
Offset: 0

Views

Author

Paul D. Hanna, Feb 18 2012

Keywords

Comments

Compare g.f. to: Sum_{n>=0} 1/(1+x)^(n^2) * Product_{k=1..n} ((1+x)^(2*k-1) - 1), which is the g.f. of A179525.

Examples

			G.f.: A(x) = 1 + x + 3*x^2 + 12*x^3 + 64*x^4 + 420*x^5 + 3276*x^6 +...
such that, by definition,
A(x) = 1 + ((1+x)-1) + ((1+x)-1)*((1+x)^3-1)/(1+x)^2 + ((1+x)-1)*((1+x)^3-1)*((1+x)^5-1)/(1+x)^6 + ((1+x)-1)*((1+x)^3-1)*((1+x)^5-1)*((1+x)^7-1)/(1+x)^20 +...
		

Crossrefs

Programs

  • PARI
    {a(n)=polcoeff(sum(m=0,n,prod(k=1,m,(1+x)^(2*k-1)-1)/(1+x+x*O(x^n))^(m^2-m) ),n)}
    for(n=0,25,print1(a(n),", "))

Formula

Given A(x) is the g.f. of this sequence, note that:
1 + x*A(x) = Sum_{n>=0} 1/(1+x)^(n^2+n) * Product_{k=1..n} ((1+x)^(2*k-1) - 1).
a(n) ~ 2*sqrt(6) * 12^(n+1) * n^(n+1) / (exp(n+Pi^2/24) * Pi^(2*n+3)). - Vaclav Kotesovec, May 07 2014