login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324820 Xor-Moebius transform of A324815. 4
0, 0, 0, 4, 0, 2, 0, 12, 12, 0, 0, 2, 0, 2, 16, 16, 0, 4, 0, 0, 36, 0, 0, 0, 24, 0, 20, 6, 0, 50, 0, 56, 4, 0, 40, 44, 0, 2, 128, 0, 0, 38, 0, 0, 56, 0, 0, 8, 48, 10, 4, 0, 0, 4, 72, 4, 512, 2, 0, 34, 0, 0, 36, 72, 8, 6, 0, 4, 4, 40, 0, 100, 0, 0, 40, 6, 80, 130, 0, 8, 16, 0, 0, 22, 256, 0, 2048, 8, 0, 90, 128, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

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 by David A. Corneth

A324815(n) = bitand(2*A156552(n), A323243(n)); \\ Needs code also from A323243.

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

CROSSREFS

Cf. A156552, A323243, A324815, A324821, A324878.

Sequence in context: A272203 A324815 A019200 * A337996 A087604 A090538

Adjacent sequences:  A324817 A324818 A324819 * A324821 A324822 A324823

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 June 25 04:07 EDT 2021. Contains 345451 sequences. (Running on oeis4.)