id:A110898 - OEIS Search Results

Search: id:A110898

Displaying 1-1 of 1 results found.

page 1

Let fw[n_] := Mod[n, 4], fb[n_] := Mod[n, 3]; a(n) = a(n-a(n-1))+1+fw[n-a(n-2)]-fb[n-a(n-1)].

+0
1

0, 1, 3, 3, 2, 6, 1, 3, 8, 3, 5, 2, 8, 8, 4, 4, 9, 8, 6, 11, 6, 7, 5, 7, 10, 7, 11, 9, 12, 7, 8, 6, 10, 9, 7, 14, 6, 9, 6, 12, 14, 11, 6, 9, 15, 9, 12, 15, 10, 15, 13, 5, 17, 7, 15, 14, 8, 18, 16, 10, 12, 18, 16, 15, 15, 14, 20, 15, 6, 18, 17, 17, 17, 7, 16, 9, 15, 15, 19, 13, 16, 13, 21, 17 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`A modular chaotic recursive sequence with three functional parts on modulo 4 forward and modulo 3 backward functions.`
	MATHEMATICA	`fw[n_] := Mod[n, 4] fb[n_] := Mod[n, 3] f[0] = 0; f[1] = 1; f[n_Integer?Positive] := f[n] = f[n - f[n - 1]] + 1 + fw[n - f[n - 2]] - fb[n - f[n - 1]] a = Table[f[n], {n, 0, 200}]`
	CROSSREFS	`Sequence in context: A116644 A070163 A083343 this_sequence A106365 A086636 A115055` `Adjacent sequences: A110895 A110896 A110897 this_sequence A110899 A110900 A110901`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 20 2005`

page 1

Search completed in 0.002 seconds

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.

AT&T Labs Research