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,3

Comments

A walk based on A004001.

Links

Table of n, a(n) for n=1..105.

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}]]

Crossrefs

Cf. A004001, A089991.

Sequence in context: A123515 A058648 A112174 * A071427 A248813 A235917

Adjacent sequences: A089987 A089988 A089989 * A089991 A089992 A089993

Keyword

nonn

Author

Roger L. Bagula, Jan 14 2004

Status

approved