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.
%I A324195 #8 Feb 20 2019 21:43:40 %S A324195 0,1,2,3,4,3,8,7,6,5,16,7,32,9,6,15,64,7,128,15,10,17,256,15,12,33,14, %T A324195 27,512,7,1024,31,18,65,12,15,2048,129,34,31,4096,11,8192,51,14,257, %U A324195 16384,31,24,13,66,99,32768,15,20,63,130,513,65536,15,131072,1025,30,63,36,19,262144,195,258,13,524288,31,1048576,2049,14,387,24,35,2097152,63,30 %N A324195 Cumulative bitwise-OR of A297112(d), where d ranges over the divisors d of n. %C A324195 A324180 differs from this one in that it uses XOR instead of OR, and uses only the proper divisors of n. %H A324195 Antti Karttunen, <a href="/A324195/b324195.txt">Table of n, a(n) for n = 1..4096</a> %F A324195 A000120(a(n)) = A324190(n). %o A324195 (PARI) %o A324195 A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1]))); %o A324195 A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1)); %o A324195 A297112(n) = if(1==n, 0, 2^A297167(n)); %o A324195 A324195(n) = { my(v=0); fordiv(n, d, v = bitor(v,A297112(d))); (v); }; %Y A324195 Cf. A000120, A003986, A297112, A297167, A297168, A061395, A324190, A324196, A324197. %Y A324195 Cf. also A324180. %K A324195 nonn %O A324195 1,3 %A A324195 _Antti Karttunen_, Feb 20 2019