|
%I #5 Mar 30 2012 17:34:14
%S 0,0,6,8,0,24,28,32,0,60,0,0,104,112,120,128,0,180,0,240,252,0,322,
%T 336,0,0,0,448,464,480,496,512,0,612,0,720,0,0,858,0,984,1008,0,1144,
%U 1170,0,0,0,1372,0,0,1560,1590,1620,0,0,0,0,1888,1920,1952,1984,2016,2048,0
%N Maximum lengths of chaotic walks based on the A004001 sequence.
%F a(n) = MaximumLength[ nested n walk based on A004001[n]*(-1)^A004001[n]+lastsum]
%t 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}]
%Y Cf. A004001, A089990.
%K nonn
%O 1,3
%A _Roger L. Bagula_, Jan 14 2004
|
