Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002990
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002990 Number of n-node trees with a forbidden limb of length 4.
(Formerly M0350)
+0
1
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; listen)
OFFSET

0,5

COMMENT

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

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

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.

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 this_sequence A060405 A003228 A110182

Adjacent sequences: A002987 A002988 A002989 this_sequence 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.

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


AT&T Labs Research