a(n) is the number of partitions of 3n that can be obtained by adding together three (not necessarily distinct) partitions of n.
A002220
a(n) is the number of partitions of 3n that can be obtained by adding together three (not necessarily distinct) partitions of n.
Terms
- a(0) =1a(1) =4a(2) =10a(3) =30a(4) =65a(5) =173a(6) =343a(7) =778a(8) =1518a(9) =3088a(10) =5609a(11) =10959a(12) =18990a(13) =34441a(14) =58903a(15) =102044a(16) =167499a(17) =282519a(18) =451529a(19) =737208a(20) =1160102a(21) =1836910a(22) =2828466a(23) =4410990a(24) =6670202a(25) =10161240a(26) =15186315a(27) =22758131a(28) =33480869
External references
- oeis: A002220