Voozh

A116489

Number of factorizations of n into odious numbers > 1.

1, 1, 0, 2, 0, 0, 1, 3, 0, 0, 1, 0, 1, 2, 0, 5, 0, 0, 1, 0, 1, 2, 0, 0, 1, 2, 0, 4, 0, 0, 1, 7, 0, 0, 1, 0, 1, 2, 0, 0, 1, 2, 0, 4, 0, 0, 1, 0, 2, 2, 0, 4, 0, 0, 1, 7, 0, 0, 1, 0, 1, 2, 0, 11, 0, 0, 1, 0, 1, 2, 0, 0, 1, 2, 0, 4, 1, 0, 1, 0, 1, 2, 0, 4, 0, 0, 1, 7, 0, 0, 2, 0, 1, 2, 0, 0, 1, 4, 0, 4, 0, 0, 1, 7

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

OFFSET

1,4

COMMENTS

a(2*n) >= a(n). - David A. Corneth, Mar 27 2021

LINKS

David A. Corneth, Table of n, a(n) for n = 1..10000

FORMULA

Dirichlet g.f.: prod{n is in A000069}(1/(1-1/n^s)).

EXAMPLE

a(49) = 2 as 49 = 49*1 = 7*7 and these are all factorizations of 49 into its odious divisors {1, 7, 49}. - David A. Corneth, Mar 27 2021

CROSSREFS