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.

Showing 1-1 of 1 results.

A138684 First differences of A138683.

Original entry on oeis.org

1, 3, 1, 1, 4, 1, 3, 1, 1, 1, 1, 6, 1, 3, 1, 1, 4, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 3, 1, 1, 4, 1, 3, 1, 1, 1, 1, 6, 1, 3, 1, 1, 4, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 23, 1, 3, 1, 1, 4, 1, 3, 1, 1, 1, 1, 6, 1, 3, 1, 1, 4, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 3, 1, 1, 4, 1
Offset: 1

Views

Author

John W. Layman, Mar 26 2008

Keywords

Comments

The graph of this sequence is fractal-like.
Conjecture. Let x(1)=1, x(2)=2, x(n) = 2*x(n-1) + x(n-2), and let y(1)=1, y(2)=3, y(n) = y(n-1) + y(n-2). Then if n=x(k), a(n)=y(k); if x(k) < n < 2*x(k), a(n) = a(n-x(k)); and if 2*x(k) <= n < x(k+1), a(n)=1. (This has been confirmed for n < 500.) - John W. Layman, Nov 26 2011

Crossrefs

Cf. A114889, A114890, A138683.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.