login
A339814
The exponent of the highest power of 2 dividing (A019565(2n) - 1).
5
1, 2, 1, 1, 2, 1, 3, 1, 5, 1, 2, 2, 1, 7, 1, 2, 1, 6, 1, 1, 4, 1, 2, 1, 2, 1, 5, 3, 1, 2, 1, 4, 1, 2, 1, 1, 2, 1, 3, 1, 4, 1, 2, 2, 1, 4, 1, 2, 1, 4, 1, 1, 5, 1, 2, 1, 2, 1, 4, 3, 1, 2, 1, 1, 3, 1, 2, 2, 1, 3, 1, 4, 1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 3, 6, 1, 2, 1, 2, 1, 4, 1, 1, 5, 1, 2, 1, 3, 1, 2, 2, 1, 3, 1, 5, 1
OFFSET
1,2
COMMENTS
The 2-adic valuation of A339809(2n).
LINKS
FORMULA
a(n) = A007814(A339809(2*n)) = A007814(A019565(2*n)-1).
a(n) = A007814(A003961(A019565(n))-1).
PROG
(PARI)
A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
A339814(n) = valuation((A019565(2*n)-1), 2);
CROSSREFS
Bisection of A339813.
Sequence in context: A034807 A275111 A182961 * A135062 A088428 A025838
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 18 2020
STATUS
approved