Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A339893 a(n) = A000523(n) - A001222(n); floor(log_2(n)) minus the number of prime divisors of n, counted with multiplicity. 3
0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 2, 0, 2, 1, 1, 0, 3, 1, 3, 1, 2, 2, 3, 0, 2, 2, 1, 1, 3, 1, 3, 0, 3, 3, 3, 1, 4, 3, 3, 1, 4, 2, 4, 2, 2, 3, 4, 0, 3, 2, 3, 2, 4, 1, 3, 1, 3, 3, 4, 1, 4, 3, 2, 0, 4, 3, 5, 3, 4, 3, 5, 1, 5, 4, 3, 3, 4, 3, 5, 1, 2, 4, 5, 2, 4, 4, 4, 2, 5, 2, 4, 3, 4, 4, 4, 0, 5, 3, 3, 2, 5, 3, 5, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,11
LINKS
FORMULA
a(n) = A000523(n) - A001222(n).
a(n) = A339895(A122111(n)).
PROG
(PARI) A339893(n) = (#binary(n) - 1 - bigomega(n));
CROSSREFS
Cf. A000523, A001222, A029744 (positions of 0's), A339895.
Cf. also A339823, A342657 [= a(A156552(n))].
Sequence in context: A231714 A366445 A354578 * A343606 A112553 A026610
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 21 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 19:26 EDT 2024. Contains 375273 sequences. (Running on oeis4.)