id:A087839 - OEIS Search Results

Search: id:A087839

Displaying 1-1 of 1 results found.

page 1

a[n] =a[a[a[a[a[n-2]]]]]+ 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, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`A fifth order recursion based on Colin Mallows's sequence A005229.` `Differs from A106742 at n = 233 where this is 23 whereas A106742(233) = 22. - Joshua Zucker, May 17 2007`
	MATHEMATICA	`Mallows[n_Integer?Positive] := Mallows[n] = Mallows[Mallows[Mallows[Mallows[Mallows[n-2]]]]]+ Mallows[n - Mallows[n-2]] Mallows[1] = Mallows[2] = 1 digits=200 a=Table[Mallows[n], {n, 1, digits}]`
	CROSSREFS	`Cf. A004001, A005229, A106742.` `Sequence in context: A085423 A130241 A130247 this_sequence A106742 A106733 A087838` `Adjacent sequences: A087836 A087837 A087838 this_sequence A087840 A087841 A087842`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 07 2003`
	EXTENSIONS	`Edited by njas, Jun 15 2007`

page 1

Search completed in 0.002 seconds

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.

AT&T Labs Research