|
%I #9 Mar 27 2021 08:07:26
%S 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,
%T 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,
%U 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
%N Number of factorizations of n into odious numbers > 1.
%C a(2*n) >= a(n). - _David A. Corneth_, Mar 27 2021
%H David A. Corneth, <a href="/A116489/b116489.txt">Table of n, a(n) for n = 1..10000</a>
%F Dirichlet g.f.: prod{n is in A000069}(1/(1-1/n^s)).
%e 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
%Y Cf. A000069, A116488, A116490.
%K nonn
%O 1,4
%A _Christian G. Bower_, Feb 17 2006
|
