Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058385
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058385 Essentially parallel series-parallel networks with n unlabeled edges, multiple edges not allowed. +0
3
0, 1, 0, 1, 2, 4, 9, 20, 47, 112, 274, 678, 1709, 4346, 11176, 28966, 75656, 198814, 525496, 1395758, 3723986, 9975314, 26817655, 72332320, 195679137, 530814386, 1443556739, 3934880554, 10748839215, 29420919456, 80678144437, 221618678694 (list; graph; listen)
OFFSET

0,5

REFERENCES

J. W. Moon, Some enumerative results on series-parallel networks, Annals Discrete Math., 33 (1987), 199-226 (the sequence q_n).

LINKS

Index entries for sequences mentioned in Moon (1987)

S. R. Finch, Series-parallel networks

FORMULA

G.f. satisfies 1-x+x^2+2*A(x) = Product_{j=1..inf} (1-x^j)^(-a(j)).

MAPLE

Q := x; q[1] := 1; for d from 1 to 40 do q[d+1] := c; Q := Q+c*x^(d+1); t0 := mul((1-x^j)^(-q[j]), j=1..d+1); t01 := series(t0, x, d+2); t05 := series(2*Q +1-x+x^2 -t01, x, d+2); t1 := coeff(t05, x, d+1); t2 := solve(t1, c); q[d+1] := t2; Q := subs(c=t2, Q); Q := series(Q, x, d+2); od: A058385 := n->coeff(Q, x, n);

CROSSREFS

Cf. A058379, A058386, A058387.

Sequence in context: A036618 A003018 A035084 this_sequence A058386 A095980 A036619

Adjacent sequences: A058382 A058383 A058384 this_sequence A058386 A058387 A058388

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Dec 20 2000

page 1

Search completed in 0.003 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research