A324195 Cumulative bitwise-OR of A297112(d), where d ranges over the divisors d of n.

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, 27, 512, 7, 1024, 31, 18, 65, 12, 15, 2048, 129, 34, 31, 4096, 11, 8192, 51, 14, 257, 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

Offset: 1

Author

Antti Karttunen, Feb 20 2019

Keywords

• nonn

Comments

A324180 differs from this one in that it uses XOR instead of OR, and uses only the proper divisors of n.

Links

• Antti Karttunen, Table of n, a(n) for n = 1..4096

Crossrefs

Cf. A000120, A003986, A297112, A297167, A297168, A061395, A324190, A324196, A324197.

Cf. also A324180.

Programs

PARI

A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1));
A297112(n) = if(1==n, 0, 2^A297167(n));
A324195(n) = { my(v=0); fordiv(n, d, v = bitor(v,A297112(d))); (v); };

Formula

A000120(a(n)) = A324190(n).