id:A087774 - OEIS Search Results

Search: id:A087774

Displaying 1-1 of 1 results found.

page 1

a[1] = 1, a[2] = a[3] = 2; a[n] = 3*a[a[n-1]] - 3*a[n-a[n-1]]+a[n-3].

+0
3

11, 2, 2, 1, 2, 5, 1, 2, 8, 1, 2, 11, 1, 2, 14, 1, 2, 17, 1, 2, 20, 1, 2, 23, 1, 2, 26, 1, 2, 29, 1, 2, 32, 1, 2, 35, 1, 2, 38, 1, 2, 41, 1, 2, 44, 1, 2, 47, 1, 2, 50, 1, 2, 53, 1, 2, 56, 1, 2, 59, 1, 2, 62, 1, 2, 65, 1, 2, 68, 1, 2, 71, 1, 2, 74, 1, 2, 77, 1, 2, 80, 1, 2, 83, 1, 2, 86, 1, 2, 89, 1 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`A recursive finite third derivative sequence. A tick-tock sequence of the form 1,2,a(n-3)+3`
	MATHEMATICA	`hg[n_Integer?Positive] := hg[n] =3hg[hg[n-1]] -3hg[n-hg[n-1]]+hg[n-3] hg[1]=1 hg[2]=2 hg[3]=2 digits=200 a=Table[hg[n], {n, 1, digits}]`
	CROSSREFS	`Cf. A004001, A087775.` `Sequence in context: A045998 A027645 A010190 this_sequence A040118 A099268 A070277` `Adjacent sequences: A087771 A087772 A087773 this_sequence A087775 A087776 A087777`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 04 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research