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.

A044051 a(n) = (s(n)+1)/2, where s=A006995 (base-2 palindromes).

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 9, 11, 14, 16, 17, 23, 26, 32, 33, 37, 43, 47, 50, 54, 60, 64, 65, 77, 83, 95, 98, 110, 116, 128, 129, 137, 149, 157, 163, 171, 183, 191, 194, 202, 214, 222, 228, 236, 248, 256, 257, 281, 293, 317, 323, 347, 359, 383
Offset: 1

Views

Author

Melia Aldridge, ma38(AT)spruce.evansville.edu

Keywords

Comments

A141707(a(n)) = 1. - Reinhard Zumkeller, Apr 20 2015

Crossrefs

Programs

  • Haskell
    a044051 = (`div` 2) . (+ 1) . a006995 . (+ 1)
    -- Reinhard Zumkeller, Apr 20 2015

Formula

Let n >= 3, m=floor(log_2(n)), p=floor((3*2^(m-1)-1)/n); then a(n) = 2^(2*m-2-p) + 1 + p*(1-(-1)^n)*2^(m-1) + (1/2)*Sum_{k=1..m-1-p} (floor((n - (3-p)*2^(m-1))/2^(m-1-k)) mod 2)*(2^k + 2^(2*m-1-p-k)). - Hieronymus Fischer, Feb 18 2012