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.

A353790 a(n) = A353749(sigma(A003961(n))), where A353749(k) = phi(k) * A064989(k), and A064989 shifts the prime factorization one step towards lower primes, while A003961 shifts the factorization one step towards higher primes.

Original entry on oeis.org

1, 2, 4, 132, 4, 16, 8, 48, 870, 16, 30, 528, 24, 32, 32, 5390, 24, 1740, 16, 528, 96, 120, 48, 384, 1224, 96, 1056, 1056, 16, 128, 306, 7920, 240, 96, 64, 114840, 120, 64, 288, 384, 140, 384, 32, 3960, 3480, 192, 144, 21560, 9180, 2448, 192, 3168, 96, 4224, 240, 768, 192, 64, 870, 4224, 416, 1224, 6960, 1191372, 192
Offset: 1

Views

Author

Antti Karttunen, May 10 2022

Keywords

Comments

See comments in A353789.

Crossrefs

Programs

  • PARI
    A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
    A064989(n) = { my(f=factor(n>>valuation(n, 2))); for(i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f); };
    A353790(n) = { my(s=sigma(A003961(n))); (eulerphi(s)*A064989(s)); };

Formula

a(n) = A353750(A003961(n)) = A326042(n) * A353767(n).
a(n) = A000010(A003973(n)) * A064989(A003973(n)).