login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A138684
First differences of A138683.
1
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,2
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
KEYWORD
nonn
AUTHOR
John W. Layman, Mar 26 2008
STATUS
approved