Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090594
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090594 G.f. satisfies: A(x + x*A(-x)) = x + x*A(x). +0
1
0, 1, 2, 4, 10, 28, 92, 328, 1330, 5740, 27596, 139160, 769964, 4423736, 27567048, 177127440, 1223262698, 8667225836, 65523382052, 506370134232, 4150248267164, 34679055629960, 305773367599064, 2742997917079984, 25853946568986188 (list; graph; listen)
OFFSET

0,3

COMMENT

Series reversion of g.f. A(x) is -A(-x). The g.f. for A006196 (leftist trees with n leaves) also satisfies this condition: A(-A(-x)) = x. This sequence was inspired by communication with Michael Somos, while he was investigating this and similar functional equations and their resulting sequences.

FORMULA

G.f.: A(-A(-x)) = x.

PROGRAM

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

CROSSREFS

Cf. A006196.

Sequence in context: A149831 A149832 A091175 this_sequence A085549 A022492 A123429

Adjacent sequences: A090591 A090592 A090593 this_sequence A090595 A090596 A090597

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 05 2003

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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research