login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A116489
Number of factorizations of n into odious numbers > 1.
4
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
OFFSET
1,4
COMMENTS
a(2*n) >= a(n). - David A. Corneth, Mar 27 2021
LINKS
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
KEYWORD
nonn
AUTHOR
Christian G. Bower, Feb 17 2006
STATUS
approved