Hi.

I have problems solving this problem:

How many partitions of a number n are there, if none of the components of the partition equals 1?

What I've got so far is that for

n=1 we have 0,

n=2 and n=3 we have 1

n=4 and n=5 we have 2

n=6 and n=7 we have 3

but then for n=8 we get 7 and for n=9 we get 8.

Unless I'm making mistakes while counting. Anyway, I do not see any relations here.

Could someone help me?