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.

A354995 a(n) = A354933(n) - A034699(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8
Offset: 1

Views

Author

Antti Karttunen, Jun 18 2022

Keywords

Crossrefs

Cf. A051283 (apparently gives the positions of nonzero terms). Cf. also A354996.

Programs

  • Mathematica
    a[n_] := SelectFirst[Divisors[n], # >= n/# && CoprimeQ[#, n/#] &] - Max[Power @@@ FactorInteger[n]]; Array[a, 100] (* Amiram Eldar, Jun 18 2022 *)
  • PARI
    A034699(n) = if(1==n, n, my(f=factor(n)); vecmax(vector(#f[, 1], i, f[i, 1]^f[i, 2])));
    A354933(n) = fordiv(n,d,if((d>=(n/d)) && 1==gcd(d,n/d), return(d)));
    A354995(n) = (A354933(n) - A034699(n));