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.

A114890 First differences of A114889.

Original entry on oeis.org

2, 1, 3, 2, 1, 1, 1, 1, 6, 2, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 2, 1, 3, 2, 1, 1, 1, 1, 6, 2, 1, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 42, 2, 1, 3, 2, 1, 1, 1, 1, 6, 2, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

John W. Layman, Jan 04 2006

Keywords

Crossrefs

Cf. A114889.

Formula

Conjecture. a(1)=2 and, for n>1, a(n)=1+3+9+...+3^(k-1) + 2, if n=3^k, a(n)=a(n-3^k), if 3^k < n < 2*3^k - 1, else a(n)=1. (This has been verified for n<=3000.)