login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A273657 Number of forests of labeled rooted trees of height at most 1, with n labels, seven of which are used for root nodes and any root may contain >= 1 labels. 2
877, 26104, 463212, 6409320, 76595310, 832521096, 8480449692, 82506827832, 776400941745, 7128606776720, 64261876786536, 571350882111984, 5026991629995036, 43878686837771760, 380672326962043560, 3287071510635218064, 28280022744131688519, 242602886107926614952 (list; graph; refs; listen; history; text; internal format)
OFFSET
7,1
LINKS
FORMULA
E.g.f.: x^7/7! * Sum_{j=0..7} Stirling2(7,j)*exp(x)^j.
a(n) = C(n,7) * Sum_{j=0..7} Stirling2(7,j) * j^(n-7).
MAPLE
a:= n-> binomial(n, 7)*add(Stirling2(7, j)*j^(n-7), j=0..7):
seq(a(n), n=7..40);
CROSSREFS
Column k=7 of A143396.
Sequence in context: A294057 A255947 A048791 * A188391 A209464 A209526
KEYWORD
nonn
AUTHOR
Alois P. Heinz, May 27 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 09:18 EDT 2024. Contains 371935 sequences. (Running on oeis4.)