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.

A206917 Sum of binary palindromes in the half-open interval [2^(n-1), 2^n).

Original entry on oeis.org

0, 1, 3, 12, 24, 96, 192, 768, 1536, 6144, 12288, 49152, 98304, 393216, 786432, 3145728, 6291456, 25165824, 50331648, 201326592, 402653184, 1610612736, 3221225472, 12884901888, 25769803776, 103079215104, 206158430208, 824633720832, 1649267441664, 6597069766656
Offset: 0

Views

Author

Hieronymus Fischer, Feb 18 2012

Keywords

Comments

First differences of A206918.

Examples

			a(0) = 0, since there is no binary palindrome 2^(-1) <= p < 2^0;
a(3) = 12, since 2^2 <= p < 2^3 for p = 5 and p = 7.
		

Formula

a(n) = (3/8)*2^(n+floor((n+1)/2)).
a(n) = 8*a(n-2) for n>3. G.f.: -x*(4*x^2+3*x+1) / (8*x^2-1). - Colin Barker, May 31 2013

Extensions

More terms from Colin Barker, May 31 2013