|
%I #10 Dec 15 2021 17:37:53
%S 1,0,1,0,1,0,1,0,2,0,1,0,1,0,2,0,1,0,1,0,2,0,1,0,2,0,3,0,1,0,1,0,2,0,
%T 2,0,1,0,2,0,1,0,1,0,4,0,1,0,2,0,2,0,1,0,2,0,2,0,1,0,1,0,4,0,2,0,1,0,
%U 2,0,1,0,1,0,4,0,2,0,1,0,5,0,1,0,2,0,2,0,1,0,2,0,2,0,2,0,1,0,4,0,1,0,1,0,5
%N Number of factorizations of n into odd factors > 1 (a(1) = 1 by convention).
%H Antti Karttunen, <a href="/A349907/b349907.txt">Table of n, a(n) for n = 1..20000</a>
%F a(2n) = 0, a(2n-1) = A001055(2n-1).
%o (PARI) A349907(n, m=n) = if(1==n, 1, my(s=0); fordiv(n, d, if((d>1)&&(d<=m)&&(d%2), s += A349907(n/d, d))); (s));
%Y Cf. A001055, A349906.
%Y Cf. A000004, A340101 (even and odd bisections).
%K nonn
%O 1,9
%A _Antti Karttunen_, Dec 13 2021
|
