A097744 Number of ways n can be written as difference of two distinct partition numbers.

2, 3, 1, 4, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 2, 0, 1, 0, 2, 2, 2, 0, 1, 1, 1, 1, 2, 1, 1, 0, 1, 0, 0, 2, 2, 0, 1, 0, 1, 1, 3, 0, 0, 0, 2, 0, 1, 0, 1, 0, 1, 0, 1, 1, 3, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 1, 1, 0, 1, 2, 1, 0, 0, 2, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 2, 0, 1, 2, 1, 0, 0, 0, 0, 2

Offset

1,1

Comments

a(A000065(n)) > 0; a(A002865(n)) > 0 for n>2;

a(A097746(n)) = 0, a(A097745(n)) > 0.

Links

Table of n, a(n) for n=1..105.

Example

a(27)=2: 27 = 30-3 = A000041(9)-A000041(3) =
= 42-15 = A000041(10)-A000041(7).

Crossrefs

Cf. A000041.

Sequence in context: A365715 A081877 A049076 * A055445 A135560 A138967

Adjacent sequences: A097741 A097742 A097743 * A097745 A097746 A097747

Keyword

nonn

Author

Reinhard Zumkeller, Aug 23 2004

Status

approved