A087817 - OEIS

This site is supported by donations to The OEIS Foundation.

A087817

a(n) = a(a(a(n-1)))+a(n-a(n-1)).

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

	OFFSET	`0,3`
	COMMENTS	`A triple recursion based on A004001.`
	FORMULA	`Conjecture : a(n) is asymptotic to n^c with c=0.677.... - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 05 2004`
	MATHEMATICA	`Conway1[1] = Conway1[2] = 1; Conway1[n_Integer?Positive] :=Conway1[n] = Conway1[Conway1[Conway1[n - 1]]] + Conway1[n - Conway1[n - 1]]; a = Table[Conway1[n], {n, 1, digits}]`
	CROSSREFS	`Cf. A004001. Different from A087836.` `Sequence in context: A060802 A132073 * A087836 A091497 A005707 A087828` `Adjacent sequences: A087814 A087815 A087816 * A087818 A087819 A087820`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 05 2003`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.