The number of ways of partitioning the multiset {1,1,2,3,...,n-1} into exactly three nonempty parts.
A168583
The number of ways of partitioning the multiset {1,1,2,3,...,n-1} into exactly three nonempty parts.
Terms
- a(0) =1a(1) =4a(2) =16a(3) =58a(4) =196a(5) =634a(6) =1996a(7) =6178a(8) =18916a(9) =57514a(10) =174076a(11) =525298a(12) =1582036a(13) =4758394a(14) =14299756a(15) =42948418a(16) =128943556a(17) =387027274a(18) =1161475036a(19) =3485211538a(20) =10457207476a(21) =31374768154a(22) =94130595916a(23) =282404370658a(24) =847238277796
External references
- oeis: A168583