The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324180 SumXOR variant of A297168. 5
 0, 0, 0, 1, 0, 3, 0, 3, 2, 5, 0, 3, 0, 9, 6, 7, 0, 5, 0, 3, 10, 17, 0, 3, 4, 33, 6, 3, 0, 5, 0, 15, 18, 65, 12, 7, 0, 129, 34, 15, 0, 9, 0, 3, 6, 257, 0, 3, 8, 9, 66, 3, 0, 9, 20, 23, 130, 513, 0, 15, 0, 1025, 6, 31, 36, 17, 0, 3, 258, 9, 0, 3, 0, 2049, 10, 3, 24, 33, 0, 23, 14, 4097, 0, 23, 68, 8193, 514, 39, 0, 9, 40, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..4096 FORMULA a(n) = Cumulative XOR of A297112(d), where d ranges over the proper divisors d of n. PROG (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)); A324180(n) = { my(v=0); fordiv(n, d, if(d

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 25 16:32 EDT 2022. Contains 354071 sequences. (Running on oeis4.)