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.

A326145 Numbers n for which n - A007947(n) is equal to gcd(n - A007947(n), sigma(n) - A007947(n) - n).

Original entry on oeis.org

6, 28, 496, 936, 1638, 8128, 33550336
Offset: 1

Views

Author

Antti Karttunen, Jun 09 2019

Keywords

Comments

Numbers n such that either A066503(n) and A326143(n) are both zero or A066503(n) is not zero and divides A326143(n).
Question: Are there any odd terms?
No other terms < 2^31.

Crossrefs

Programs

  • PARI
    A007947(n) = factorback(factorint(n)[, 1]);
    isA326145(n) = { my(b=A007947(n), t=n-b, u = (sigma(n)-b)-n); (gcd(t,u)==t); };
    \\ Or alternatively as:
    isA326145(n) = { my(t=A326143(n), u=A066503(n)); ((!u && !t)||(u && !(t%u))); };