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.

A107684 Union of sequences 2^k-1, 2^k and 2^k+1.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 7, 8, 9, 15, 16, 17, 31, 32, 33, 63, 64, 65, 127, 128, 129, 255, 256, 257, 511, 512, 513, 1023, 1024, 1025, 2047, 2048, 2049, 4095, 4096, 4097, 8191, 8192, 8193, 16383, 16384, 16385, 32767, 32768, 32769, 65535, 65536, 65537, 131071
Offset: 0

Views

Author

Reinhard Zumkeller, May 20 2005

Keywords

Comments

Subsequence of A107686.

Crossrefs

Programs

  • Mathematica
    Flatten[{#-1,#,#+1}&/@(2^Range[0,20])]//Union (* Harvey P. Dale, Oct 06 2017 *)

Formula

a(n) = if n<=2 then n else 2^(floor(n/3)+1) + n mod 3 - 1. - Reinhard Zumkeller, Jun 05 2005
G.f.:-x*(1+3*x+6*x^2+7*x^3+6*x^4+4*x^5+2*x^6)/((2*x^3-1)*(x^2+x+1)) [From Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009]

Extensions

Description corrected by Henrik Lundquist, Jun 06 2005