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.

A303534 Amount by which n exceeds the largest binary palindrome less than or equal to n.

Original entry on oeis.org

0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 3, 4, 5, 0, 1, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 0, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3
Offset: 0

Views

Author

Allan C. Wechsler, Apr 25 2018

Keywords

Examples

			The largest binary palindrome that doesn't exceed 30 is 27 (11011 r2). 30 - 27 = 3, so a(30) = 3.
		

Crossrefs

A006995 lists the binary palindromes.
A206913 gives the largest binary palindrome that does not exceed n.
Cf. also A261424 (analog in base 10), A280506, A303536.

Programs

Formula

a(n) = n - A206913(n).

Extensions

More terms from Altug Alkan, Apr 25 2018
Showing 1-1 of 1 results.