OFFSET
1,2
COMMENTS
This sequence is a variant of A256739; both sequences have nice graphical features.
Replacing "SumXOR" by "Sum" in the name leads to the Jordan function J_2 (A007434).
For any sequence f of nonnegative integers with positive indices:
- let x_f be the unique sequence satisfying SumXOR_{d divides n} x_f(d) = f(n) for any n > 0,
- see the links section for a gallery of x_f plots for some classic f functions,
- x_f(1) = f(1),
- x_f(p) = f(1) XOR f(p) for any prime p,
- x_f(n) = SumXOR_{d divides n and n/d is squarefree} f(d) for any n > 0,
- the function x: f -> x_f is a bijection,
- for any sequence f, x_{2*f} = 2 * x_f,
- for any sequences g and f, x_{g XOR f} = x_g XOR x_f.
From Antti Karttunen, Dec 29 2017: (Start)
The transform x_f described above could be called "Xor-Moebius transform of f" because of its analogous construction to Möbius transform with A008683 replaced by A008966 and the summation replaced by cumulative XOR.
(End)
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..16383
Rémy Sigrist, Colored scatterplot of the first 2^17-1 terms (where the color is function of A087207(n) % 8)
Rémy Sigrist, Scatterplot of the first 2^16 terms of x_A000203 (sigma)
FORMULA
a(n) = SumXOR_{d divides n and n/d is squarefree} d^2.
PROG
(PARI) a(n{, f=k->k^2}) = my (v=0); fordiv(n, d, if (issquarefree(n/d), v=bitxor(v, f(d)))); return (v)
CROSSREFS
Cf. A000004, A000010, A000027, A000040, A000079, A000290, A000720, A001157, A003987, A005132, A006370, A007434, A008966, A055895, A063524, A087207, A178910.
KEYWORD
nonn,base
AUTHOR
Rémy Sigrist, Nov 29 2017
STATUS
approved