Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131623
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131623 Number of blocks in all partitions of n-set with distinct block sizes. +0
1
1, 1, 7, 9, 31, 223, 442, 1529, 6559, 66111, 159952, 742503, 3047656, 19094286, 245173117, 761328969, 3935539271, 20213664703, 117323673136, 897132508439, 15791065424134, 56649181720176, 353387529508691, 1955231849465423 (list; graph; listen)
OFFSET

1,3

FORMULA

E.g.f.: Sum(x^n/(n!+x^n),n=1..inf)*Product(1+x^n/n!,n=1..inf).

MAPLE

A131623 := proc(n) local su, i ; su := add(x^i/(i!+x^i), i=1..n+1) ; for i from 1 to n do su := taylor(su*(1+x^i/i!), x=0, n+1) ; od: n!*coeftayl(su, x=0, n) ; end: seq(A131623(n), n=1..30) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 25 2007

CROSSREFS

Cf. A044048, A007837.

Sequence in context: A085903 A147248 A147186 this_sequence A032011 A083203 A082536

Adjacent sequences: A131620 A131621 A131622 this_sequence A131624 A131625 A131626

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 02 2007

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 25 2007

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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research