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

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

Author

Antti Karttunen, Dec 18 2020

Keywords

• nonn

Comments

The 2-adic valuation of A339809(n).

Links

• Antti Karttunen, Table of n, a(n) for n = 1..65537

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)).