This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089991 Maximum lengths of chaotic walks based on the A004001 sequence. 1
 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 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: A143819 A021599 A072553 * A083727 A111838 A197479 Adjacent sequences:  A089988 A089989 A089990 * A089992 A089993 A089994 KEYWORD nonn AUTHOR Roger L. Bagula, Jan 14 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 22 09:21 EDT 2017. Contains 290943 sequences.