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!)
A188455 G.f.: 1 = Sum_{n>=0} a(n)*x^n/(1 + 2^n*x)^(2n+1). 2
1, 1, 5, 77, 3191, 332481, 83495679, 49089025473, 66142622730623, 200954040909283841, 1359156203343916471295, 20253823024219712679748609, 659335186924510858208484730879, 46554554840488755704034417937268737 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
G.f. satisfies a variant of an identity of the Catalan numbers (A000108):
1 = Sum_{n>=0} A000108(n)*x^n/(1 + x)^(2n+1).
Also, g.f. satisfies a variant of an identity involving A003024:
1 = Sum_{n>=0} A003024(n)*x^n/(1 + 2^n*x)^(n+1),
where A003024(n) is the number of acyclic digraphs with n labeled nodes.
LINKS
EXAMPLE
G.f.: 1 = 1/(1+x) + x/(1+2*x)^3 + 5*x^2/(1+4*x)^5 + 77*x^3/(1+8*x)^7 + 3191*x^4/(1+16*x)^9 + 332481*x^5/(1+32*x)^11 +...
PROG
(PARI) {a(n)=polcoeff(1-sum(k=0, n-1, a(k)*x^k/(1+2^k*x+x*O(x^n))^(2*k+1)), n)}
CROSSREFS
Sequence in context: A360351 A318236 A009485 * A015056 A326870 A327903
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Mar 31 2011
STATUS
approved

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 24 14:32 EDT 2024. Contains 371960 sequences. (Running on oeis4.)