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.

A379232 Terms k of A104210 for which abs(A003961(k)-(2*k)) is prime, where A003961 is fully multiplicative with a(prime(i)) = prime(i+1), and A104210 gives numbers m for which gcd(m,A003961(m)) > 1.

Original entry on oeis.org

6, 15, 35, 77, 646, 1334, 2294, 5681, 6293, 78793, 600677, 2255002, 2482402, 4564166, 8702275, 16798717, 17747807, 22197526, 236981285, 302764377, 1287983157, 2111098886, 2295003595
Offset: 1

Views

Author

Antti Karttunen, Dec 23 2024

Keywords

Comments

The definition entails that both abs(A379231(n)) and A151799(abs(A379231(n))) divide a(n).
If it exists, a(24) > 2^32.

Crossrefs