A089990 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

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