A347730 Number of compositions (ordered partitions) of n into at most 2 triangular numbers.
1, 1, 1, 1, 2, 0, 2, 2, 0, 2, 1, 2, 1, 2, 0, 1, 4, 0, 2, 0, 1, 3, 2, 0, 2, 2, 0, 2, 1, 2, 1, 4, 0, 0, 2, 0, 3, 2, 2, 2, 0, 0, 3, 2, 0, 1, 4, 0, 2, 2, 0, 4, 0, 0, 0, 3, 3, 2, 2, 0, 2, 2, 0, 0, 2, 2, 3, 2, 0, 2, 2, 0, 3, 2, 0, 0, 4, 0, 1, 2
Offset: 0
Formula
a(n) = c(n) + Sum_{k=1..n-1} c(k) * c(n-k), where c = A010054. - Wesley Ivan Hurt, Jan 06 2024