OFFSET
0,10
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1000
EXAMPLE
The a(n) partitions for n = 3, 9, 15, 21, 25, 27:
(3) (9) (15) (21) (25) (27)
(3,3,3) (5,5,5) (7,7,7) (15,5,5) (9,9,9)
(9,3,3) (9,9,3) (5,5,5,5,5) (15,9,3)
(3,3,3,3,3) (15,3,3) (21,3,3)
(9,3,3,3,3) (9,9,3,3,3)
(3,3,3,3,3,3,3) (15,3,3,3,3)
(9,3,3,3,3,3,3)
(3,3,3,3,3,3,3,3,3)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], And@@OddQ/@#&&GCD@@#>1&]], {n, 15}]
PROG
(Python)
from math import gcd
from sympy.utilities.iterables import partitions
def A366852(n): return sum(1 for p in partitions(n) if all(d&1 for d in p) and gcd(*p)>1) # Chai Wah Wu, Nov 02 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Nov 01 2023
EXTENSIONS
More terms from Chai Wah Wu, Nov 02 2023
a(0)=0 prepended by Alois P. Heinz, Jan 11 2024
STATUS
approved