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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144646 a(n) = Bell(n) - 2^n + n. 1
0, 0, 0, 0, 3, 25, 145, 756, 3892, 20644, 114961, 676533, 4209513, 27636258, 190882952, 1382925792, 10480076627, 82864738749, 682076544033, 5832741680788, 51724157186816, 474869814059620, 4506715734253041, 44152005846695761, 445958869278028097 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

Number of partitions of an n-set having more than one block of size > 1.

- Peter Luschny, Apr 10 2011

EXAMPLE

a(5) = 25 = card({25|134, 35|124, 125|34, 345|12, 45|123, 235|14, 15|234, 145|23, 135|24, 245|13, 25|4|13, 35|4|12, 45|3|12, 5|24|13, 5|12|34, 1|35|24, 35|2|14, 25|3|14, 5|14|23, 1|45|23, 15|4|23, 45|2|13, 15|3|24, 15|2|34, 1|25|34}). - Peter Luschny, Apr 10 2011

CROSSREFS

Cf. A000110, A094782.

Sequence in context: A099868 A112495 A034578 * A000544 A037776 A037664

Adjacent sequences:  A144643 A144644 A144645 * A144647 A144648 A144649

KEYWORD

nonn

AUTHOR

Jean-Yves Tallet (jean-yves.tallet(AT)club-internet.fr) and N. J. A. Sloane (njas(AT)research.att.com), Jan 26 2009

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 10:09 EST 2012. Contains 205614 sequences.