A324862 a(n) is the binary length of A324878(n).

0, 0, 0, 1, 0, 1, 0, 0, 3, 0, 0, 1, 0, 1, 4, 4, 0, 3, 0, 0, 5, 1, 0, 0, 0, 1, 4, 1, 0, 4, 0, 4, 0, 1, 5, 4, 0, 1, 7, 0, 0, 5, 0, 1, 4, 1, 0, 4, 0, 0, 2, 1, 0, 4, 6, 0, 9, 1, 0, 0, 0, 1, 5, 6, 0, 1, 0, 1, 0, 5, 0, 5, 0, 1, 5, 1, 6, 7, 0, 4, 0, 1, 0, 1, 8, 1, 11, 0, 0, 6, 7, 1, 0, 1, 9, 5, 0, 1, 7, 5, 0, 2, 0, 0, 6

Offset: 1

Author

Antti Karttunen, Mar 21 2019

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10000
• Index entries for sequences related to binary expansion of n
• Index entries for sequences computed from indices in prime factorization
• Index entries for sequences related to sigma(n)

Crossrefs

Cf. A000040, A000523, A070939, A324878, A324861, A324864, A324874.

Programs

PARI

A324862(n) = #binary(A324878(n)); \\ Needs also code from A324878.

Formula

If A324878(n) = 0, a(n) = 0, otherwise a(n) = A070939(A324878(n)) = 1 + A000523(A324878(n)).

a(p) = 0 for all primes p.