A318434 - OEIS

A318434

Number of ways to split the integer partition with Heinz number n into consecutive subsequences with equal sums.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

LINKS

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

EXAMPLE

The a(3072) = 5 constant-sum split partitions:

(21111111111)

(21111)(111111)

(211)(1111)(1111)