OFFSET
0,3
EXAMPLE
The a(1) = 1 through a(8) = 13 partitions:
(1) (2) (3) (4) (5) (6) (7) (8)
(11) (111) (22) (32) (33) (43) (44)
(31) (41) (51) (52) (53)
(1111) (311) (222) (61) (62)
(11111) (411) (322) (71)
(3111) (331) (332)
(111111) (511) (611)
(4111) (2222)
(31111) (3311)
(1111111) (5111)
(41111)
(311111)
(11111111)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], Intersection[#, -Differences[#]]=={}&]], {n, 0, 30}]
PROG
(Python)
from collections import Counter
from sympy.utilities.iterables import partitions
def A363260(n): return sum(1 for s, p in map(lambda x: (x[0], tuple(sorted(Counter(x[1]).elements()))), partitions(n, size=True)) if set(p).isdisjoint({p[i+1]-p[i] for i in range(s-1)})) # Chai Wah Wu, Sep 26 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jul 19 2023
STATUS
approved