Number of partitions of an integer, if the partitions are no larger than $2$

27 Views Asked by At

Find an explicit formula for the number of partitions of a positive integer $k$ into parts no larger than $2$?

I was thinking about it and worked on it, I've come up with $1^k+2^k= 3^n$.