# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a144646
Showing 1-1 of 1

%I A144646 #19 Oct 12 2023 03:43:13
%S A144646 0,0,0,0,3,25,145,756,3892,20644,114961,676533,4209513,27636258,
%T A144646 190882952,1382925792,10480076627,82864738749,682076544033,
%U A144646 5832741680788,51724157186816,474869814059620,4506715734253041,44152005846695761,445958869278028097
%N A144646 a(n) = Bell(n) - 2^n + n.
%C A144646 Number of partitions of an n-set having more than one block of size > 1. - _Peter Luschny_, Apr 10 2011
%H A144646 Amiram Eldar, <a href="/A144646/b144646.txt">Table of n, a(n) for n = 0..576</a>
%e A144646 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
%t A144646 Table[BellB[n] - 2^n + n, {n, 0, 24}] (* _Amiram Eldar_, Nov 23 2019 *)
%o A144646 (Magma) [Bell(n) -2^n +n: n in [0..30]]; // _G. C. Greubel_, Oct 12 2023
%o A144646 (SageMath) [bell_number(n) - 2^n +n for n in range(31)] # _G. C. Greubel_, Oct 12 2023
%Y A144646 Cf. A000110, A094782.
%K A144646 nonn
%O A144646 0,5
%A A144646 _Jean-Yves Tallet_ and _N. J. A. Sloane_, Jan 26 2009

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE