a(n) is the number of ways of putting n labeled balls into 2 indistinguishable boxes such that each box contains at least 3 balls.

A272352

a(n) is the number of ways of putting n labeled balls into 2 indistinguishable boxes such that each box contains at least 3 balls.

Terms

    a(0) =10a(1) =35a(2) =91a(3) =210a(4) =456a(5) =957a(6) =1969a(7) =4004a(8) =8086a(9) =16263a(10) =32631a(11) =65382a(12) =130900a(13) =261953a(14) =524077a(15) =1048344a(16) =2096898a(17) =4194027a(18) =8388307a(19) =16776890a(20) =33554080a(21) =67108485a(22) =134217321a(23) =268435020a(24) =536870446a(25) =1073741327a(26) =2147483119a(27) =4294966734a(28) =8589933996a(29) =17179868553

External references