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.

A175299 a(n) = the smallest positive integer such that A175298(a(n)) = the n-th positive integer that is a palindrome when written in binary.

Original entry on oeis.org

1, 2, 4, 6, 8, 10, 16, 20, 18, 22, 32, 36, 34, 38, 64, 72, 68, 76, 66, 74, 70, 78, 128, 136, 132, 140, 130, 138, 134, 142, 256, 272, 264, 280, 260, 276, 268, 284, 258, 274, 266, 282, 262, 278, 270, 286, 512, 528, 520, 536, 516, 532, 524, 540, 514, 530, 522
Offset: 1

Views

Author

Leroy Quet, Mar 24 2010

Keywords

Crossrefs

Formula

a(n) = 2^floor(log_2(P(n))) + P(n)(mod 2^(floor(log_2(P(n))/2)+1)) -1, where P(n) = the n-th positive integer that is a palindrome when written in binary.

Extensions

More terms from Nathaniel Johnston, Nov 18 2010