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”).
%I #11 Feb 05 2016 20:42:08
%S 0,0,0,0,1,0,0,0,0,1,0,0,1,0,1,0,1,0,0,1,0,0,0,0,2,1,0,0,1,1,0,0,0,1,
%T 1,0,1,0,1,1,1,0,0,0,1,0,0,0,0,2,1,1,1,0,1,0,0,1,0,1,1,0,0,0,1,0,0,1,
%U 0,1,0,0,1,1,2,0,0,1,0,1,0,1,0,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0,0,2,1,1,0,1,1,1,0,0,1,1,1,0,1,0,1,1,1,0,1,1
%N Bitwise-OR of the exponents of all 4k+1 primes in the prime factorization of n.
%H Antti Karttunen, <a href="/A267113/b267113.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A267116(A170818(n)).
%F Other identities. For all n >= 0:
%F a(n) = a(A170818(n)). [The result depends only on the prime factors of the form 4k+1.]
%F a(n) <= A083025(n).
%e For n = 65 = 5 * 13 = (4+1)^1 * ((3*4)+1)^1, bitwise-or of 1 and 1 is 1, thus a(65) = 1.
%o (Scheme, with memoization-macro definec)
%o (definec (A267113 n) (cond ((< n 5) 0) ((even? n) (A267113 (/ n 2))) ((= 3 (modulo (A020639 n) 4)) (A267113 (A032742 n))) (else (A003986bi (A067029 n) (A267113 (A028234 n)))))) ;; A003986bi implements bitwise-or (see A003986).
%Y Cf. A170818, A267116, A260728.
%Y Cf. A004144 (indices of zeros), A009003 (of nonzeros).
%Y Differs from both A046080 and A083025 for the first time at n=65, which here a(65) = 1.
%K nonn
%O 1,25
%A _Antti Karttunen_, Feb 03 2016