id:A087823 - OEIS Search Results

Search: id:A087823

Displaying 1-1 of 1 results found.

page 1

a(n) = a(a(a(n-2)))+a(n-a(n-2))

+0
2

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

	OFFSET	`1,3`
	COMMENT	`A triply recursive version of Mallows A005229.`
	MATHEMATICA	`Mallows[n_Integer?Positive] := Mallows[n] =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. A005229, A005374.` `Adjacent sequences: A087820 A087821 A087822 this_sequence A087824 A087825 A087826` `Sequence in context: A080405 A039728 A029119 this_sequence A037037 A120565 A029108`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 06 2003`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research