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.

Showing 1-2 of 2 results.

A324644 a(n) = gcd(sigma(n), A276086(n)).

Original entry on oeis.org

1, 3, 2, 1, 6, 1, 2, 15, 1, 9, 6, 1, 2, 3, 6, 1, 18, 1, 10, 3, 2, 9, 6, 5, 1, 3, 10, 1, 30, 1, 2, 21, 6, 9, 6, 7, 2, 15, 14, 45, 42, 1, 2, 21, 6, 9, 6, 1, 1, 3, 6, 7, 18, 5, 2, 15, 10, 45, 30, 7, 2, 3, 2, 1, 42, 1, 2, 21, 6, 9, 18, 5, 2, 3, 2, 35, 6, 7, 10, 3, 1, 63, 42, 7, 2, 3, 30, 45, 90, 1, 14, 21, 2, 9, 6, 7, 98, 3, 6, 7, 6, 1, 2, 105, 6
Offset: 1

Views

Author

Antti Karttunen, Mar 11 2019

Keywords

Crossrefs

Cf. A088828 (positions of even terms), A176693 (of odd terms).

Programs

  • PARI
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    A324644(n) = gcd(sigma(n),A276086(n));

Formula

a(n) = gcd(A000203(n), A276086(n)).

A374476 Composite numbers k such that the least prime dividing the sum of divisors of k is equal to the least prime not dividing k.

Original entry on oeis.org

8, 15, 21, 27, 32, 33, 35, 39, 45, 50, 51, 55, 57, 63, 65, 69, 75, 77, 85, 87, 91, 93, 95, 98, 99, 105, 111, 115, 117, 119, 123, 125, 128, 129, 133, 135, 141, 143, 145, 147, 153, 155, 159, 161, 165, 171, 175, 177, 183, 185, 187, 189, 195, 196, 200, 201, 203, 205, 207, 209, 213, 215, 217, 219, 221, 231, 235, 237
Offset: 1

Views

Author

Antti Karttunen, Aug 06 2024

Keywords

Crossrefs

Intersection of A002808 and A374475.
Cf. A228058 (subsequence), and also A324534, A351458, A364286.

Programs

Showing 1-2 of 2 results.