OFFSET
0,6
EXAMPLE
The a(3) = 1 through a(11) = 13 partitions:
(3) . (5) (3,3) (7) (3,3,2) (9) (5,5) (11)
(3,2) (4,3) (5,4) (4,3,3) (6,5)
(5,2) (6,3) (3,3,2,2) (7,4)
(3,2,2) (7,2) (8,3)
(3,3,3) (9,2)
(4,3,2) (4,4,3)
(5,2,2) (5,4,2)
(3,2,2,2) (6,3,2)
(7,2,2)
(3,3,3,2)
(4,3,2,2)
(5,2,2,2)
(3,2,2,2,2)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], GCD@@Select[#, OddQ]>1&]], {n, 0, 30}]
PROG
(Python)
from math import gcd
from sympy.utilities.iterables import partitions
def A366842(n): return sum(1 for p in partitions(n) if gcd(*(q for q in p if q&1))>1) # Chai Wah Wu, Oct 28 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Oct 28 2023
STATUS
approved