A089991 - 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

A089991

Maximum lengths of chaotic walks based on the A004001 sequence.

0, 0, 6, 8, 0, 24, 28, 32, 0, 60, 0, 0, 104, 112, 120, 128, 0, 180, 0, 240, 252, 0, 322, 336, 0, 0, 0, 448, 464, 480, 496, 512, 0, 612, 0, 720, 0, 0, 858, 0, 984, 1008, 0, 1144, 1170, 0, 0, 0, 1372, 0, 0, 1560, 1590, 1620, 0, 0, 0, 0, 1888, 1920, 1952, 1984, 2016, 2048, 0

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

OFFSET

1,3

LINKS

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

FORMULA

a(n) = MaximumLength[ nested n walk based on A004001[n]*(-1)^A004001[n]+lastsum]

MATHEMATICA

Conway[n_Integer?Positive] := Conway[n] =Conway[Conway[n-1]] + Conway[n - Conway[n-1]] Conway[1] = Conway[2] = 1 digits=200 b=Table[(-1)^Conway[n]*Conway[n], {n, 1, digits}] ChaosWalk[n_Integer?Positive] := NestList[(#+b[[n]])&, 0, n] ChaosWalk[1]=0 a=Table[Max[ChaosWalk[n]], {n, 1, digits}]

CROSSREFS

Cf. A004001, A089990.

Sequence in context: A372605 A021599 A072553 * A083727 A111838 A197479

Adjacent sequences: A089988 A089989 A089990 * A089992 A089993 A089994

KEYWORD

nonn

AUTHOR

Roger L. Bagula, Jan 14 2004

STATUS

approved