A324904 The 2-adic valuation of A318466(n), where A318466(n) = 2*n OR sigma(n).

0, 0, 1, 0, 1, 2, 1, 0, 0, 1, 1, 2, 1, 2, 1, 0, 1, 0, 1, 1, 1, 2, 1, 2, 0, 1, 1, 3, 1, 2, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 0, 0, 1, 1, 1, 2, 1, 3, 1, 1, 1, 3, 1, 2, 1, 0, 1, 2, 1, 1, 1, 2, 1, 0, 1, 1, 1, 2, 1, 2, 1, 1, 0, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 0, 1, 0, 1, 2, 1, 1, 1

Offset

1,6

Links

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

Index entries for sequences related to binary expansion of n

Index entries for sequences related to sigma(n)

Formula

a(n) = A007814(A318466(n)).

a(n) = A324902(n) + A324903(n).

Prog

(PARI)
A318466(n) = bitor(2*n, sigma(n));
A324904(n) = valuation(A318466(n), 2);
(Python)
from sympy import divisor_sigma
def A324904(n): return (~(m:=n<<1|int(divisor_sigma(n))) & m-1).bit_length() # Chai Wah Wu, Jul 01 2022

Crossrefs

Cf. A000203, A001065, A003986, A007814, A318466, A324884, A324902, A324903, A324906.

Sequence in context: A334744 A136567 A336569 * A109708 A035468 A369311

Adjacent sequences: A324901 A324902 A324903 * A324905 A324906 A324907

Keyword

nonn

Author

Antti Karttunen, Mar 28 2019

Status

approved