|
|
A144646
|
|
a(n) = Bell(n) - 2^n + n.
|
|
2
|
|
|
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;
text;
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
|
|
LINKS
|
|
|
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
|
|
MATHEMATICA
|
Table[BellB[n] - 2^n + n, {n, 0, 24}] (* Amiram Eldar, Nov 23 2019 *)
|
|
PROG
|
(Magma) [Bell(n) -2^n +n: n in [0..30]]; // G. C. Greubel, Oct 12 2023
(SageMath) [bell_number(n) - 2^n +n for n in range(31)] # G. C. Greubel, Oct 12 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|