cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A323883 Dirichlet inverse of A322026.

Original entry on oeis.org

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
Offset: 1

Views

Author

Antti Karttunen, Feb 08 2019

Keywords

Crossrefs

Programs

  • 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(dA323883(n) = v323883[n];