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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038000 Number of forests of rooted trees where n dollars are spent and an n-node tree costs 2n-1 dollars. 1
1, 1, 2, 2, 4, 5, 9, 11, 21, 28, 50, 68, 123, 173, 310, 441, 789, 1147, 2044, 2999, 5351, 7938, 14143, 21138, 37686, 56729, 101144, 153085, 273077, 415407, 741301, 1132373, 2021831, 3100128, 5537782, 8519076, 15225373 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

N. J. A. Sloane, Transforms

FORMULA

EULER transform of {c(x)} where {c(x)} has g.f. B(x^2)/x = x+x^3+2*x^5+4*x^7+9*x^9+... and B(x) = x+x^2+2*x^3+4*x^4+9*x^5+... is g.f. for A000081.

CROSSREFS

Sequence in context: A144118 A187069 A089935 * A204856 A124280 A088518

Adjacent sequences:  A037997 A037998 A037999 * A038001 A038002 A038003

KEYWORD

nonn,easy

AUTHOR

Christian G. Bower (bowerc(AT)usa.net)

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 16 14:07 EST 2012. Contains 205930 sequences.