A362831 Number of partitions of n into two distinct parts (s,t) such that pi(s) = pi(t).

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

Offset

1,17

Links

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

Index entries for sequences related to partitions

Formula

a(n) = Sum_{k=1..floor((n-1)/2)} [pi(k) = pi(n-k)], where [ ] is the Iverson bracket and pi is the prime counting function (A000720).

a(n) = (A362721(n-1) - ((n-1) mod 2))/2.

Example

a(51) = 3. The 3 partitions of 51 are (23,28), (24,27), and (25,26).

Mathematica

Table[Sum[KroneckerDelta[PrimePi[k], PrimePi[n - k]], {k, Floor[(n - 1)/2]}], {n, 100}]

Crossrefs

Cf. A000720 (pi), A362721.

Sequence in context: A338971 A244600 A288558 * A269241 A086013 A340671

Adjacent sequences: A362828 A362829 A362830 * A362832 A362833 A362834

Keyword

nonn,easy

Author

Wesley Ivan Hurt, May 04 2023

Status

approved