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.

A079872 a(1)=0, a(n) = signum(round(n^(1/Omega(n)))^Omega(n) - n), where Omega(n) is the total number of prime factors of n (A001222).

Original entry on oeis.org

0, 0, 0, 0, 0, -1, 0, 0, 0, -1, 0, -1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, -1, 0, -1, 0, -1, 0, -1, 0, 0, 1, 1, 1, -1, 0, -1, -1, 1, 0, -1, 0, 1, 1, 1, 0, -1, 0, 1, -1, 1, 0, 1, -1, 1, 1, 1, 0, 1, 0, 1, 1, 0, -1, -1, 0, -1, -1, -1, 0, -1, 0, 1, -1, -1, 1, -1, 0, -1, 0, -1, 0, -1, -1, -1, -1, -1, 0, -1, 1, 1, 1, 1, 1, -1
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 13 2003

Keywords

Comments

a(m) = 0 iff m is a prime power (A000961).

Crossrefs

Programs

  • Mathematica
    A079872[n_] := If[n == 1, 0, Sign[Round[n^(1/#)]^# - n] & [PrimeOmega[n]]];
    Array[A079872, 100] (* Paolo Xausa, Sep 02 2025 *)

Formula

a(n) = A057427(A079869(n) - n).