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.

A119350 First differences of A118374.

Original entry on oeis.org

1, 1, 4, 1, 1, 1, 1, 6, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 4, 1, 1, 1, 1, 6, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 18, 1, 1, 4, 1, 1, 1, 1, 6, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 4, 1, 1, 1, 1, 6, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

John W. Layman, May 23 2006

Keywords

Crossrefs

Formula

Conjecture. Define g(1)=1 and, for i>1, g(i)=2*g(i-1)+2^(i-2). Also define h(1)=1, h(2)=4 and, for i>2, h(i)=h(i-1)+2^(i-2). Then a(n)=h(i) if n=g(i), a(n)=1 if g(i)-2^(i-2)<=n