A366880 -id:A366880 - cp's OEIS frontend

A366879 a(n) = A326938(A163511(n)), where A326938 is the Dirichlet inverse of the sum of divisors d of n such that n/d is odd.

1, -2, 0, -4, 0, 3, 8, -6, 0, 0, -6, 5, 0, 24, 12, -8, 0, 0, 0, 0, 0, -20, -10, 7, 0, -18, -48, 48, 0, 32, 16, -12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 40, -42, 0, -28, -14, 11, 0, 0, 36, -40, 0, -192, -96, 96, 0, -24, -64, 72, 0, 48, 24, -14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -30, 35, 0, 168, 84

Offset: 0

Graph
List
Refs
Listen
History
Text
Internal format

Antti Karttunen, Oct 27 2023

sign

Antti Karttunen, Table of n, a(n) for n = 0..16384
Index entries for sequences related to binary expansion of n

Cf. A002131, A163511, A326938, A366880 (rgs-transform).

Cf. also A366875.

A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
A326938(n) = sumdiv(n, d, if(n/d%2, moebius(n/d)*moebius(d)*d));
A366879(n) = A326938(A163511(n));

cp's OEIS Frontend

A366879 a(n) = A326938(A163511(n)), where A326938 is the Dirichlet inverse of the sum of divisors d of n such that n/d is odd.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI