|
%I #5 Mar 30 2012 17:34:14
%S 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,
%T 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,
%U 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
%N a(n) = n step nested walk based on (A004001[n]+ (-1)^lastsum)
%C A walk based on A004001.
%t 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}]]
%Y Cf. A004001, A089991.
%K nonn
%O 1,3
%A _Roger L. Bagula_, Jan 14 2004
|
