Number of ways of partitioning the multiset {1,1,1,2,3,...,n-2} into exactly three nonempty parts.

A168605

Number of ways of partitioning the multiset {1,1,1,2,3,...,n-2} into exactly three nonempty parts.

Terms

    a(0) =1a(1) =2a(2) =8a(3) =30a(4) =104a(5) =342a(6) =1088a(7) =3390a(8) =10424a(9) =31782a(10) =96368a(11) =291150a(12) =877544a(13) =2640822a(14) =7938848a(15) =23849310a(16) =71613464a(17) =214971462a(18) =645176528a(19) =1936053870a(20) =5809210184a(21) =17429727702a(22) =52293377408a(23) =156888520830a(24) =470682339704

External references