[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A244892 a(n) = a(n-a(n-1)) with initial values 5,2,5,2. 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Periodic with period (5,2,5,2,5).
LINKS
S. W. Golomb, Discrete chaos: sequences satisfying "strange" recursions, unpublished manuscript, circa 1990 [cached copy, with permission (annotated)]
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, 0, [5, 2, 5, 2]), n=0..100)];
MATHEMATICA
LinearRecurrence[{0, 0, 0, 0, 1}, {5, 2, 5, 2, 5}, 76] (* Ray Chandler, Aug 25 2015 *)
CROSSREFS
Sequence in context: A168464 A059688 A072996 * A278066 A153107 A247488
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jul 17 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 31 05:08 EDT 2024. Contains 375550 sequences. (Running on oeis4.)