|
Search: id:A116575
|
|
|
| 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
1
|
|
| 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; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
"Limited chaotic sequence" based on A005229.
a(n) = 0 for n > 16.
|
|
PROGRAM
|
(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
|
Cf. A005229.
Sequence in context: A026797 A027189 A140829 this_sequence A090492 A103609 A129526
Adjacent sequences: A116572 A116573 A116574 this_sequence A116576 A116577 A116578
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 19 2006
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Apr 10 2006 and Apr 16 2006
|
|
|
Search completed in 0.006 seconds
|
