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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A206917 Sum of binary palindromes in the half-open interval [2^(n-1), 2^n). 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
First differences of A206918.
LINKS
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
EXAMPLE
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.
CROSSREFS
Sequence in context: A028725 A047166 A076506 * A320334 A009776 A331241
KEYWORD
nonn,base,easy
AUTHOR
Hieronymus Fischer, Feb 18 2012
EXTENSIONS
More terms from Colin Barker, May 31 2013
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 16:58 EDT 2024. Contains 371254 sequences. (Running on oeis4.)