login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324878 Xor-Moebius transform of A324398, where A324398(n) = A156552(n) AND (A323243(n) - A156552(n)). 5
0, 0, 0, 1, 0, 1, 0, 0, 6, 0, 0, 1, 0, 1, 8, 8, 0, 6, 0, 0, 16, 1, 0, 0, 0, 1, 12, 1, 0, 8, 0, 8, 0, 1, 20, 8, 0, 1, 66, 0, 0, 17, 0, 1, 8, 1, 0, 8, 0, 0, 2, 1, 0, 12, 36, 0, 258, 1, 0, 0, 0, 1, 16, 40, 0, 1, 0, 1, 0, 20, 0, 24, 0, 1, 24, 1, 32, 67, 0, 8, 0, 1, 0, 1, 132, 1, 1026, 0, 0, 40, 72, 1, 0, 1, 256, 16, 0, 1, 68, 16, 0, 3, 0, 0, 46 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,9

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552)

Index entries for sequences related to binary expansion of n

Index entries for sequences computed from indices in prime factorization

Index entries for sequences related to sigma(n)

FORMULA

a(p) = 0 for all primes p.

PROG

(PARI)

A156552(n) = {my(f = factor(n), p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552

A318458(n) = bitand(n, sigma(n)-n);

A324398(n) = if(1==n, 0, A318458(A156552(n)));

\\ Or, equivalently:

A324398(n) = { my(k=A156552(n)); bitand(k, (A323243(n)-k)); }; \\ Needs also code from A323243.

A324878(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A324398(d)))); (v); };

CROSSREFS

Cf. A156552, A318458, A324820, A324821, A324876, A324877.

Sequence in context: A305324 A322379 A225339 * A324398 A171916 A325740

Adjacent sequences:  A324875 A324876 A324877 * A324879 A324880 A324881

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 18 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 05:14 EST 2019. Contains 329839 sequences. (Running on oeis4.)