cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A344182 a(n) = A344026(n) XOR A344028(n).

This page as a plain text file.
%I A344182 #7 May 23 2021 03:21:34
%S A344182 0,0,0,6,0,0,5,8,0,0,0,26,15,26,18,40,0,0,0,22,0,0,63,56,9,14,31,34,
%T A344182 82,124,119,64,0,0,0,50,0,0,45,88,0,0,0,98,99,38,234,88,29,114,29,202,
%U A344182 35,34,136,160,162,444,406,130,393,430,452,224,0,0,0,42,0,0,97,120,0,0,0,46,215,222,130,136,0,0,0,202
%N A344182 a(n) = A344026(n) XOR A344028(n).
%H A344182 Antti Karttunen, <a href="/A344182/b344182.txt">Table of n, a(n) for n = 0..16384</a>
%H A344182 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A344182 a(n) = A344026(n) XOR A344028(n) = A003415(A005940(1+n)) XOR A069359(A005940(1+n)).
%o A344182 (PARI)
%o A344182 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A344182 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); (t); };
%o A344182 A069359(n) = (n*sumdiv(n, d, isprime(d)/d)); \\ From A069359
%o A344182 A344182(n) = { my(u=A005940(1+n)); bitxor(A003415(u),A069359(u)); };
%Y A344182 Cf. A003415, A003714 (positions of zeros), A005940, A069359, A344026, A344028.
%K A344182 nonn
%O A344182 0,4
%A A344182 _Antti Karttunen_, May 16 2021