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.

Previous Showing 11-11 of 11 results.

A339813 The exponent of the highest power of 2 dividing (A019565(n) - 1).

Original entry on oeis.org

0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 5, 0, 1, 0, 2, 0, 2, 0, 1, 0, 7, 0, 1, 0, 2, 0, 1, 0, 6, 0, 1, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 5, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 4, 0, 1, 0, 2, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 1, 0
Offset: 1

Views

Author

Antti Karttunen, Dec 18 2020

Keywords

Comments

The 2-adic valuation of A339809(n).

Crossrefs

Cf. A007814, A339809, A339814 (bisection).

Programs

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

Formula

a(n) = A007814(A339809(n)).
Previous Showing 11-11 of 11 results.