OFFSET
1,1
COMMENTS
In calculating terms of this sequence, use the convention that a(n)=0 for n<=0.
Most terms in this sequence alternate between 2 and a term of A275163. These runs are separated by 18 other terms, and each run is approximately twice as long as the previous.
LINKS
Nathan Fox, Table of n, a(n) for n = 1..10000
Nathan Fox, Hofstadter-like Sequences over Nonstandard Integers", Talk given at the Rutgers Experimental Mathematics Seminar, November 10 2016.
FORMULA
MATHEMATICA
a[1] = 5; a[2] = 2; a[n_] := a[n] = If[n < 1, 0, a[n-a[n-1]] + a[n-a[n-2]]];
Array[a, 100] (* Paolo Xausa, May 30 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Nathan Fox, Nov 13 2016
STATUS
approved