Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122486
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122486 a(n) = Sum_{k=0..n} |Stirling1(n,k)|*Bell(k)^2. +0
1
1, 1, 5, 39, 425, 6053, 107735, 2321469, 59152987, 1750362419, 59286010621, 2271617296347, 97502863649141, 4649359584613201, 244550369307356039, 14101227268075911837, 886551391533830227267, 60482082002935189216499 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = exp(-2)*Sum_{r,s>=0} [r*s]^n/(r!*s!), where [m]^n = m*(m+1)*...*(m+n-1) is the rising factorial.

MAPLE

with(combinat): seq(sum(abs(stirling1(n, k))*bell(k)^2, k=0..n), n=0..19); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 08 2006

CROSSREFS

Cf. A000110, A059849.

Adjacent sequences: A122483 A122484 A122485 this_sequence A122487 A122488 A122489

Sequence in context: A024216 A127189 A121354 this_sequence A118991 A029538 A015874

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 15 2006, Sep 19 2006

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 08 2006

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 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research