Number of ways of writing n as an unordered sum of at most 3 nonzero triangular numbers.

Terms

a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =2a(7) =2a(8) =1a(9) =2a(10) =2a(11) =1a(12) =3a(13) =2a(14) =1a(15) =2a(16) =3a(17) =2a(18) =2a(19) =2a(20) =1a(21) =4a(22) =3a(23) =2a(24) =2a(25) =2a(26) =2a(27) =3a(28) =3a(29) =1