OFFSET
1,4
COMMENTS
This sequence increases slowly, and each term repeats at least three times.
If k is not a power of 2, then k appears in this sequence the same number of times as it appears in A081832. Otherwise, it appears exactly one additional time.
LINKS
Nathan Fox, Table of n, a(n) for n = 1..10000
A. Erickson, A. Isgur, B. W. Jackson, F. Ruskey and S. M. Tanny, Nested recurrence relations with Conolly-like solutions, See Conjecture 5.1.
FORMULA
a(n+1)-a(n)=1 or 0.
a(n)/n -> C=1/4.
MAPLE
PROG
(Magma) [n le 3 select 1 else Self(n-2*Self(n-1))+Self(n-1-2*Self(n-2)): n in [1..100]]; // Vincenzo Librandi, Jul 09 2018
(GAP) a:=[1, 1, 1];; for n in [4..80] do a[n]:=a[n-2*a[n-1]]+a[n-1-2*a[n-2]]; od; a; # Muniru A Asiru, Jul 09 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Nathan Fox and Altug Alkan, Jul 08 2018
STATUS
approved