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.

A339971 Odd part of A339821(n).

Original entry on oeis.org

1, 1, 1, 1, 3, 3, 3, 3, 5, 5, 5, 5, 15, 15, 15, 15, 3, 3, 3, 3, 9, 9, 9, 9, 15, 15, 15, 15, 45, 45, 45, 45, 1, 1, 1, 1, 3, 3, 3, 3, 5, 5, 5, 5, 15, 15, 15, 15, 3, 3, 3, 3, 9, 9, 9, 9, 15, 15, 15, 15, 45, 45, 45, 45, 9, 9, 9, 9, 27, 27, 27, 27, 45, 45, 45, 45, 135, 135, 135, 135, 27, 27, 27, 27, 81, 81, 81, 81, 135
Offset: 0

Views

Author

Antti Karttunen, Dec 26 2020

Keywords

Crossrefs

Programs

  • PARI
    A000265(n) = (n>>valuation(n,2));
    A339971(n) = { my(m=1, p=2); while(n>0, p = nextprime(1+p); if(n%2, m *= A000265(p-1)); n >>= 1); (m); };

Formula

If 4n = 2^e1 + 2^e2 + ... + 2^ek [e1 ... ek distinct], then a(n) = A057023(e1) * A057023(e2) * ... * A057023(ek).
a(n) = A339821(n) / A000079(A339822(n)).