Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052315
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052315 M-type rooted trees on n nodes. +0
2
1, 4, 17, 83, 432, 2416, 14093, 85188, 528234, 3343420, 21508182, 140225532, 924444270, 6152191399, 41275242100, 278865583963, 1895686831203, 12956648332412, 88984197144487, 613773294727307, 4250024962493357 (list; graph; listen)
OFFSET

1,2

REFERENCES

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 210 (3.2.68)

LINKS

Index entries for sequences related to rooted trees

N. J. A. Sloane, Transforms

FORMULA

Satisfies 2*a(n)=PSum(SHIFT_RIGHT(a)+EULER(a))-c0. c0(0)=1. c0(k)=0 if k != 0.

CROSSREFS

Cf. A006959.

Adjacent sequences: A052312 A052313 A052314 this_sequence A052316 A052317 A052318

Sequence in context: A078845 A110771 A082028 this_sequence A093904 A093344 A087316

KEYWORD

nonn,eigen

AUTHOR

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research