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,9

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)

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.

Prog

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

Crossrefs

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

Sequence in context: A337923 A363880 A324874 * A324864 A331509 A171913

Adjacent sequences: A324859 A324860 A324861 * A324863 A324864 A324865

Keyword

nonn

Author

Antti Karttunen, Mar 21 2019

Status

approved