id:A106733 - OEIS Search Results

Search: id:A106733

Displaying 1-1 of 1 results found.

page 1

a[n] =a[a[a[a[n - a[n-1]]]]] + a[n - a[n-2]].

+0
2

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

	OFFSET	`1,3`
	COMMENT	`A fifth-order recursion based on Hofstadter's Q-sequence A005185.`
	MATHEMATICA	`Hofstadter1[1] = Hofstadter1[2] = 1; Hofstadter1[n_Integer?Positive] := Hofstadter1[n] = Hofstadter1[Hofstadter1[Hofstadter1[Hofstadter1[n - Hofstadter1[n - 1]]]]] + Hofstadter1[ n - Hofstadter1[n - 2]]; a = Table[Hofstadter1[n], {n, 1, digits}]`
	CROSSREFS	`Cf. A087842, A005185.` `Sequence in context: A130247 A087839 A106742 this_sequence A087838 A057627 A013940` `Adjacent sequences: A106730 A106731 A106732 this_sequence A106734 A106735 A106736`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 30 2005`

page 1

Search completed in 0.002 seconds

Last modified November 22 20:51 EST 2009. Contains 167312 sequences.

AT&T Labs Research