|
%I #18 Jul 27 2023 08:20:21
%S 0,0,0,0,1,0,1,0,1,1,2,0,2,1,1,0,3,1,3,1,2,2,3,0,2,2,1,1,3,1,3,0,3,3,
%T 3,1,4,3,3,1,4,2,4,2,2,3,4,0,3,2,3,2,4,1,3,1,3,3,4,1,4,3,2,0,4,3,5,3,
%U 4,3,5,1,5,4,3,3,4,3,5,1,2,4,5,2,4,4,4,2,5,2,4,3,4,4,4,0,5,3,3,2,5,3,5,2,3
%N a(n) = A000523(n) - A001222(n); floor(log_2(n)) minus the number of prime divisors of n, counted with multiplicity.
%H Antti Karttunen, <a href="/A339893/b339893.txt">Table of n, a(n) for n = 1..65537</a>
%F a(n) = A000523(n) - A001222(n).
%F a(n) = A339895(A122111(n)).
%o (PARI) A339893(n) = (#binary(n) - 1 - bigomega(n));
%Y Cf. A000523, A001222, A029744 (positions of 0's), A339895.
%Y Cf. also A339823, A342657 [= a(A156552(n))].
%K nonn
%O 1,11
%A _Antti Karttunen_, Dec 21 2020
|
