OFFSET
1,2
COMMENTS
a(n) = 2 if and only if n is a prime.
FORMULA
EXAMPLE
a(6) counts these partitions: 6, 33, 321, 222, 111111.
From Gus Wiseman, Sep 14 2019: (Start)
The a(1) = 1 through a(10) = 8 partitions (A = 10):
1 2 3 4 5 6 7 8 9 A
11 111 22 11111 33 1111111 44 333 55
1111 222 2222 432 22222
321 3221 531 32221
111111 4211 111111111 33211
11111111 42211
52111
1111111111
(End)
MATHEMATICA
Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, Mean[p]]], {n, 40}]
PROG
(Python)
from sympy.utilities.iterables import partitions
def A237984(n): return sum(1 for s, p in partitions(n, size=True) if not n%s and n//s in p) # Chai Wah Wu, Sep 21 2023
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 27 2014
STATUS
approved