|
%I #16 Jun 26 2022 08:59:36
%S 1,10,101,947,8670,79249,730745,6838642,65197797,634656360,6316333291,
%T 64318009411,670336612614,7151290120037,78085166445577,
%U 872478836270306,9972817907218608,116575837400037486,1393037460835481622,17010118386233081680,212160149063581345610
%N Number of blocks of size >= eight in all set partitions of n.
%H Alois P. Heinz, <a href="/A288790/b288790.txt">Table of n, a(n) for n = 8..575</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F a(n) = Bell(n+1) - Sum_{j=0..7} binomial(n,j) * Bell(n-j).
%F a(n) = Sum_{j=0..n-8} binomial(n,j) * Bell(j).
%F E.g.f.: (exp(x) - Sum_{k=0..7} x^k/k!) * exp(exp(x) - 1). - _Ilya Gutkovskiy_, Jun 26 2022
%p b:= proc(n) option remember; `if`(n=0, 1, add(
%p b(n-j)*binomial(n-1, j-1), j=1..n))
%p end:
%p g:= proc(n, k) option remember; `if`(n<k, 0,
%p g(n, k+1) +binomial(n, k)*b(n-k))
%p end:
%p a:= n-> g(n, 8):
%p seq(a(n), n=8..30);
%t Table[Sum[Binomial[n, j] BellB[j], {j, 0, n - 8}], {n, 8, 30}] (* _Indranil Ghosh_, Jul 06 2017 *)
%o (Python)
%o from sympy import bell, binomial
%o def a(n): return sum(binomial(n, j)*bell(j) for j in range(n - 7))
%o print([a(n) for n in range(8, 31)]) # _Indranil Ghosh_, Jul 06 2017
%Y Column k=8 of A283424.
%Y Cf. A000110.
%K nonn
%O 8,2
%A _Alois P. Heinz_, Jun 15 2017
|
