login
A244893
a(n) = a(n-a(n-1)) with initial values 2,3,2.
1
2, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3
OFFSET
1,1
COMMENTS
After first term, periodic with period {3,2,3}.
LINKS
S. W. Golomb, Discrete chaos: sequences satisfying "strange" recursions, unpublished manuscript, circa 1990 [cached copy, with permission (annotated)]
FORMULA
a(n) = A164359(n), n>1. - R. J. Mathar, Jul 25 2014
MAPLE
f:=proc(n, o, S) option remember; # o = offset, S = init. terms
L:=nops(S);
if n < 0 then 0
elif n <= o+L-1 then S[n-o+1]
else f(n-f(n-1, o, S), o, S); fi; end;
[seq(f(n, 1, [2, 3, 2]), n=1..100)];
MATHEMATICA
Join[{2}, LinearRecurrence[{0, 0, 1}, {3, 2, 3}, 75]] (* Ray Chandler, Aug 25 2015 *)
CROSSREFS
Sequence in context: A124474 A282162 A276857 * A321478 A076982 A351808
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jul 17 2014
STATUS
approved