id:A089990 - OEIS Search Results

Search: id:A089990

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`1,3`
	COMMENT	`A walk based on A004001.`
	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.` `Adjacent sequences: A089987 A089988 A089989 this_sequence A089991 A089992 A089993` `Sequence in context: A123515 A058648 A112174 this_sequence A071427 A093949 A108807`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 14 2004`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research