login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324874 a(n) is the binary length of A324398(n), where A324398(n) = A156552(n) AND (A323243(n) - A156552(n)). 6
0, 0, 0, 1, 0, 1, 0, 1, 3, 0, 0, 1, 0, 1, 4, 4, 0, 1, 0, 1, 5, 1, 0, 1, 0, 1, 4, 1, 0, 1, 0, 1, 0, 1, 5, 4, 0, 1, 7, 1, 0, 1, 0, 1, 3, 1, 0, 1, 0, 0, 2, 1, 0, 1, 6, 1, 9, 1, 0, 1, 0, 1, 3, 6, 0, 1, 0, 1, 0, 1, 0, 5, 0, 1, 5, 1, 6, 1, 0, 1, 4, 1, 0, 1, 8, 1, 11, 1, 0, 6, 7, 1, 0, 1, 9, 5, 0, 0, 7, 5, 0, 1, 0, 1, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,9

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552)

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 A324398(n) = 0, a(n) = 0, otherwise a(n) = A070939(A324398(n)) = 1 + A000523(A324398(n)).

a(n) = A324868(n) + A324881(n).

a(p) = 0 for all primes p.

PROG

(PARI)

A156552(n) = {my(f = factor(n), p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552

A324398(n) = { my(k=A156552(n)); bitand(k, (A323243(n)-k)); }; \\ Needs also code from A323243.

A324874(n) = #binary(A324398(n));

CROSSREFS

Cf. A000523, A070939, A156552, A323243, A324398, A324862, A324864, A324868, A324881.

Sequence in context: A167163 A005890 A104515 * A324862 A324864 A171913

Adjacent sequences:  A324871 A324872 A324873 * A324875 A324876 A324877

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 27 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 14:37 EST 2019. Contains 329262 sequences. (Running on oeis4.)