cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A352458 2^k appears in the binary expansion of a(n) iff 2^k appears in the binary expansion of n and k AND n = 0 (where AND denotes the bitwise AND operator).

Original entry on oeis.org

0, 1, 2, 1, 4, 5, 2, 1, 8, 1, 2, 1, 12, 5, 2, 1, 16, 17, 18, 17, 4, 5, 2, 1, 24, 17, 18, 17, 12, 5, 2, 1, 32, 1, 34, 1, 4, 5, 2, 1, 40, 1, 34, 1, 12, 5, 2, 1, 48, 17, 50, 17, 4, 5, 2, 1, 56, 17, 50, 17, 12, 5, 2, 1, 64, 65, 2, 1, 4, 5, 2, 1, 72, 65, 2, 1, 12
Offset: 0

Views

Author

Rémy Sigrist, Mar 17 2022

Keywords

Comments

The idea is to keep the 1's in the binary expansion of a number whose positions are related in some way to that number.

Examples

			For n = 42:
- 42 = 2^5 + 2^3 + 2^1,
- 42 AND 5 = 0,
- 42 AND 3 = 2 <> 0,
- 42 AND 1 = 0,
- so a(42) = 2^5 + 2^1 = 34.
		

Crossrefs

See A352449, A352450, A352451, A352452 for similar sequences.
Cf. A335702 (fixed points).

Programs

  • PARI
    a(n) = { my (v=0, m=n, k); while (m, m-=2^k=valuation(m,2); if (bitand(n, k)==0, v+=2^k)); v }

Formula

a(n) <= n with equality iff n belongs to A335702.
a(n) = n - A309274(n).
Showing 1-1 of 1 results.