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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323883 Dirichlet inverse of A322026. 3
 1, -2, -3, 0, -1, 7, -1, 2, 2, 2, -1, 0, -1, 2, 3, -1, -1, -6, -1, 0, 3, 2, -1, -11, 0, 2, 3, 0, -1, -7, -1, -1, 3, 2, 1, -1, -1, 2, 3, -2, -1, -7, -1, 0, -2, 2, -1, 7, 0, 0, 3, 0, -1, -9, 1, -2, 3, 2, -1, 0, -1, 2, -2, 3, 1, -7, -1, 0, 3, -2, -1, 20, -1, 2, 0, 0, 1, -7, -1, 1, -6, 2, -1, 0, 1, 2, 3, -2, -1, 6, 1, 0, 3, 2, 1, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Antti Karttunen, Table of n, a(n) for n = 1..20000 PROG (PARI) up_to = 65537; rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om, invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om, invec[i], i); outvec[i] = u; u++ )); outvec; }; A007814(n) = valuation(n, 2); A007949(n) = valuation(n, 3); v322026 = rgs_transform(vector(up_to, n, [A007814(n), A007949(n)])); DirInverse(v) = { my(u=vector(#v)); u[1] = (1/v[1]); for(n=2, #v, u[n] = -sumdiv(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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 00:40 EST 2020. Contains 331030 sequences. (Running on oeis4.)