|
|
A116575
|
|
a(0) = 0; a(1) = a(2) = 1; for n > 2: a(n) = a(a(n-2)) + a(n-1 - abs(a(n-1) - a(n-2))) if a(n-2) < n, a(n) = 0 otherwise.
|
|
0
|
|
|
0, 1, 1, 2, 2, 3, 3, 5, 5, 8, 6, 10, 8, 12, 13, 20, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
"Limited chaotic sequence" based on A005229.
a(n) = 0 for n > 16.
|
|
LINKS
|
|
|
MATHEMATICA
|
a[0] = 0; a[1] = a[2] = 1; a[n_] := a[n] = If[a[n - 2] < n, a[a[n - 2]] + a[n - 1 - Abs[a[n - 1] - a[n - 2]]], 0]; Array[a, 32, 0] (* JungHwan Min, Jan 14 2017 *)
|
|
PROG
|
(PARI) M(n)=v[n+1] {m=32; v=vector(m+1); v[1]=0; v[2]=1; v[3]=1; for(n=3, m, c=M(n-2); v[n+1]=if(c<n, M(c)+M(n-1-abs(M(n-1)-c)), 0)); for(j=0, m, print1(M(j), ", "))}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full,less
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|