|
%I #9 Sep 27 2017 21:21:41
%S 0,0,1,0,1,1,2,0,0,1,2,1,2,2,2,0,1,0,1,1,1,2,3,1,1,2,2,2,3,2,3,0,0,1,
%T 1,0,1,1,1,1,2,1,2,2,2,3,4,1,1,1,1,2,3,2,2,2,2,3,4,2,3,3,3,0,0,0,1,1,
%U 1,1,2,0,1,1,1,1,1,1,2,1,1,2,3,1,1,2,2,2,3,2,2,3,3,4,4,1,2,1,1,1,2,1,2,2,2
%N a(n) is the number of odd primes in the sequence [n, floor(n/2), floor(n/4), ..., 1].
%H Antti Karttunen, <a href="/A292598/b292598.txt">Table of n, a(n) for n = 1..16384</a>
%F a(1) = a(2) = 0; for n > 2, a(n) = A010051(n) + a(floor(n/2)).
%F a(n) = A000120(A292596(n)).
%F For all n >= 1, a(n) <= A078349(n).
%o (Scheme, with memoization-macro definec)
%o (definec (A292598 n) (if (<= n 2) 0 (+ (A010051 n) (A292598 (floor->exact (/ n 2))))))
%Y Cf. A010051, A065091, A078349, A292596.
%K nonn
%O 1,7
%A _Antti Karttunen_, Sep 27 2017
|
