Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101313
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101313 Number of painted forests - exactly one of its trees is painted - on labeled vertex set [n]. +0
2
1, 3, 12, 68, 525, 5262, 65674, 987408, 17426565, 353759300, 8127640224, 208600774032, 5917247520457, 183872561612040, 6212370268252950, 226762373954676608, 8893485959056048521, 372980176625914811568 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = f(n) + SUM{((n-i)^(n-i-2))*C((n-1), i)*a(i):i=1, 2, ..(n-1)}, where f(n)=number of forests on labeled vertex set [n], A001858

Exponential convolution of A000272 and A001858: a(n) = Sum_{k=1..n} binomial(n, k)*k^(k-2)*A001858(n-k). E.g.f.: B(x)*exp(B(x)), where B(x) is e.g.f. for A000272. - Vladeta Jovovic (vladeta(AT)Eunet.yu), May 24 2005

EXAMPLE

a(5)=291+{(16*4*1)+(3*6*3)+(1*4*12)+(1*1*68)}=525

MAPLE

B:= n-> exp (add (k^(k-2) *x^k/k!, k = 1..n )): b:= n-> coeff (series (B(n), x, n+1) , x, n)*n!: a:= n-> add (binomial(n, k) *k^(k-2) *b(n-k), k=1..n): seq (a(n), n=1..25); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 10 2008]

CROSSREFS

Sequence in context: A039750 A004127 A058115 this_sequence A144008 A102078 A113341

Adjacent sequences: A101310 A101311 A101312 this_sequence A101314 A101315 A101316

KEYWORD

nonn

AUTHOR

Joseph G. Moser (jmoser(AT)wcupa.edu), Jan 26 2005

EXTENSIONS

More terms from Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 10 2008

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research