editing

approved

<a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 1).

LinearRecurrence[{0, 0, 0, 0, 1}, {5, 2, 5, 2, 5}, 76] (* Ray Chandler, Aug 25 2015 *)

approved

editing

editing

approved

S. W. Golomb, Discrete chaos: sequences satisfying "strange" recursions, unpublished, circa 1993.

S. W. Golomb, <a href="/A005185/a005185_1.pdf">Discrete chaos: sequences satisfying "strange" recursions</a>, unpublished manuscript, circa 1990 [cached copy, with permission (annotated)]

approved

editing

editing

approved

allocated for N. J. A. Sloane

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

5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5, 2, 5, 2, 5, 5

0,1

Periodic with period (5,2,5,2,5).

S. W. Golomb, Discrete chaos: sequences satisfying "strange" recursions, unpublished, circa 1993.

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, 0, [5, 2, 5, 2]), n=0..100)];

allocated

nonn

N. J. A. Sloane, Jul 17 2014

approved

editing

allocated for N. J. A. Sloane

allocated

approved