A089990 a(n) = n step nested walk based on (A004001[n]+ (-1)^lastsum).
1, 0, 2, 2, 0, 3, 1, 1, 0, 3, 1, 1, 1, 0, 4, 4, 4, 4, 4, 0, 5, 3, 3, 3, 3, 3, 0, 5, 3, 3, 3, 3, 3, 3, 0, 5, 3, 3, 3, 3, 3, 3, 3, 0, 6, 6, 6, 6, 6, 6, 6, 6, 6, 0, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 0, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 0, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 0, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 0, 9
Offset: 1
Keywords
Programs
-
Mathematica
Conway[n_Integer?Positive] := Conway[n] =Conway[Conway[n-1]] + Conway[n - Conway[n-1]] Conway[1] = Conway[2] = 1 digits=20 b=Table[Conway[n], {n, 1, digits}] ChaosWalk[n_Integer?Positive] := NestList[(b[[n]]+(-1)^#)&, 0, n] ChaosWalk[1]=1 a=Flatten[Table[ChaosWalk[n], {n, 1, digits}]]
Comments