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.

A351074 Difference between the maximal exponent in the prime factorization of A327860(n) and the maximal exponent in the prime factorization of n.

Original entry on oeis.org

0, -1, 0, -1, 0, -1, 0, 0, -1, 0, 0, -1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 2, 0, 1, 2, -1, 1, -4, 0, 0, 0, 0, 0, 0, 0, -2, 0, 0, 0, 0, 0, 0, 0, -2, 0, 0, 1, 0, 1, 0, 2, 0, 2, 2, 2, -1, 0, 0, -1, -4, 0, 0, 0, -1, 0, 1, 0, 0, 0, 0, -1, -1, 0, 1, 1, 3, -2, 1, 1, 1, 2, 2, 2, 0, 2, 0, 1, 2, 1, 1, 1, -3, 1, 0, 0, 1, 1, 1, 1, -1, 1
Offset: 1

Views

Author

Antti Karttunen, Feb 01 2022

Keywords

Crossrefs

Cf. A351075 (positions of negative terms), A351076 (of terms >= 0), A351077 (their characteristic function).
Cf. also A350074.

Programs

  • PARI
    A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
    A327860(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= (p^e); s += (e/p); n = n\p; p = nextprime(1+p)); (s*m); };
    A351074(n) = (A051903(A327860(n)) - A051903(n));

Formula

a(n) = A328391(n) - A051903(n) = A051903(A327860(n)) - A051903(n).