A336842 Number of trailing 1-bits in the binary representation of A003961(n): a(n) = A007814(1+A003961(n)).

1, 2, 1, 1, 3, 4, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 3, 6, 3, 3, 1, 3, 1, 2, 1, 2, 5, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 4, 3, 1, 1, 1, 2, 5, 1, 2, 3, 2, 1, 2, 1, 1, 2, 2, 4, 2, 1, 3, 2, 3, 2, 1, 3, 1, 2, 4, 2, 1, 4, 4, 8, 2, 3, 1, 1, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 1, 5, 1, 6, 1, 2, 1, 1, 3, 1, 2, 2, 1

Offset

1,2

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 computed from indices in prime factorization

Formula

a(n) = A007814(1+A003961(n)).

Prog

(PARI)
A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A007814(n) = valuation(n, 2);
A336842(n) = A007814(1+A003961(n));
(Python)
from math import prod
from sympy import factorint, nextprime
def A336842(n): return (~((m:=prod(nextprime(p)**e for p, e in factorint(n).items()))+1)& m).bit_length() # Chai Wah Wu, Jul 01 2022

Crossrefs

Cf. A003961, A007814, A246261 (positions of ones), A336843, A336844.

Sequence in context: A120019 A145034 A286510 * A159933 A305431 A128314

Adjacent sequences: A336839 A336840 A336841 * A336843 A336844 A336845

Keyword

nonn

Author

Antti Karttunen, Aug 06 2020

Status

approved