A244893 - OEIS

A244893

a(n) = a(n-a(n-1)) with initial values 2,3,2.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

After first term, periodic with period {3,2,3}.

LINKS

Table of n, a(n) for n=1..76.

S. W. Golomb, Discrete chaos: sequences satisfying "strange" recursions, unpublished manuscript, circa 1990 [cached copy, with permission (annotated)]

Index entries for linear recurrences with constant coefficients, signature (0, 0, 1).

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 *)