The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A341509 a(n) = 2^j if n is of the form 2^i - 2^j with i > j, and 0 otherwise. 3
 0, 1, 2, 1, 4, 0, 2, 1, 8, 0, 0, 0, 4, 0, 2, 1, 16, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 4, 0, 2, 1, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 4, 0, 2, 1, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Antti Karttunen, Table of n, a(n) for n = 0..65537 Index entries for sequences related to binary expansion of n FORMULA a(0) = 0, and for n >= 1, a(n) = A340375(n) * A006519(n). a(n) = A156552(A014963(A005940(1+n))). PROG (PARI) A006519(n) = (1<>=valuation(n, 2); n++; n>>valuation(n, 2)==1); \\ After function "is" given in A023758 A341509(n) = if(!n, n, A340375(n)*A006519(n)); CROSSREFS Cf. A005940, A006519, A014963, A156552, A340375. Cf. A023758 (after its initial zero, gives the positions nonzero terms). Sequence in context: A137629 A220504 A087569 * A048614 A001442 A226952 Adjacent sequences: A341506 A341507 A341508 * A341510 A341511 A341512 KEYWORD nonn AUTHOR Antti Karttunen, Feb 13 2021 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.

Last modified September 15 13:57 EDT 2024. Contains 375938 sequences. (Running on oeis4.)