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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129833 a(n) = sum_{k = 0..n } binomial(n + 1, k + 1)*binomial(n, k)*k!. 0
1, 3, 11, 52, 309, 2221, 18703, 180216, 1952457, 23466223, 309577971, 4444537868, 68948023741, 1148825560377, 20455144724407, 387479309532976, 7778881684953873, 164942847995071611, 3682885668837002587 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Suggested by A052852 (stalactic classes of endofunctions) with n replaced by n+1 in the binomial coefficients.

A052852 is: g[n_] = Sum[Binomial[n - 1, k - 1]*Binomial[n, k]*k!, {k, 0, n}] A straight shift function is: f[n_]=Sum[Binomial[n + 1, k + 1]*Binomial[n, k]*(k + 1)!, {k, 0, n}]

REFERENCES

F. Hivert, J.-C. Novelli and J.-Y. Thibon, Commutative combinatorial Hopf algebras.

MATHEMATICA

f[n_] = Sum[Binomial[n + 1, k + 1]*Binomial[n, k]*k!, {k, 0, n}]; Table[f[n], {n, 1, 20}]

CROSSREFS

Cf. A052852.

Sequence in context: A014510 A058799 A054362 * A107958 A053557 A039302

Adjacent sequences:  A129830 A129831 A129832 * A129834 A129835 A129836

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 21 2007

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Sep 30 2007

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 14 13:08 EST 2012. Contains 205623 sequences.