Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143597
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143597 G.f. satisfies: A(x) = 1 + x*A(2x)*A(-x). +0
1
1, 1, 1, 3, 19, 297, 8953, 572155, 72116459, 18460128753, 9414877745601, 9640779710687955, 19725063387945457219, 80793830752052788593529, 661701532957780822275151305, 10841317673677535233876159099755 (list; graph; listen)
OFFSET

0,4

FORMULA

G.f. satisfies: A(x) = (1 + x*A(2x))/(1 + x^2*A(2x)*A(-2x)).

a(n) = Sum_{k=0..n-1} 2^k*(-1)^(n-1-k)*a(k)*a(n-1-k) for n>0 with a(0)=1.

EXAMPLE

G.f.: A(x) = 1 + x + x^2 + 3*x^3 + 19*x^4 + 297*x^5 + 8953*x^6 +...

A(x) = 1 + x*A(2x)*[1 - x*A(-2x)*[1 + x*A(2x)*[1 - x*A(-2x)*[1 +...]]]].

PROGRAM

(PARI) {a(n)=local(A=1+x*O(x^n)); for(i=0, n, A=1+x*subst(A, x, 2*x)*subst(A, x, -x)); polcoeff(A, n)}

(PARI) {a(n)=if(n==0, 1, sum(k=0, n-1, 2^k*(-1)^(n-1-k)*a(k)*a(n-1-k)))}

CROSSREFS

Sequence in context: A054590 A069344 A003011 this_sequence A115705 A136171 A102586

Adjacent sequences: A143594 A143595 A143596 this_sequence A143598 A143599 A143600

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 28 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research