login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002990 Number of n-node trees with a forbidden limb of length 4.
(Formerly M0350)
0
1, 1, 1, 1, 2, 2, 5, 9, 19, 38, 86, 188, 439, 1026, 2472, 5997, 14835, 36964, 93246, 236922, 607111, 1565478, 4062797, 10599853, 27797420, 73224806, 193709710, 514406793, 1370937140, 3665714528, 9831891555, 26445886506, 71325268179 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

A tree with a forbidden limb of length k is a tree where the path from any leaf inward hits a branching node or another leaf within k steps.

REFERENCES

A. J. Schwenk, Almost all trees are cospectral, pp. 275-307 of F. Harary, editor, New Directions in the Theory of Graphs. Academic Press, NY, 1973.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Index entries for sequences related to trees

FORMULA

G.f.: 1+B(x)+(B(x^2)-B(x)^2)/2 where B(x) is g.f. of A052327.

CROSSREFS

Cf. A002955, A002988-A002992, A052318-A052329.

Sequence in context: A076607 A054229 A052969 * A060405 A003228 A184713

Adjacent sequences:  A002987 A002988 A002989 * A002991 A002992 A002993

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms, formula and comments from Christian G. Bower (bowerc(AT)usa.net), Dec 15 1999.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 18:09 EST 2012. Contains 205534 sequences.