id:A119583 - OEIS Search Results

Search: id:A119583

Displaying 1-1 of 1 results found.

page 1

A119583

a(1)=0, a(2)=0, a(3)=0, a(4)=1 then a(n)=abs(a(n-1)-2*a(n-2)+a(n-3))-a(n-4).

+0
1

0, 0, 0, 1, 1, 1, 0, 0, 0, -1, 1, 3, 0, 6, 8, 1, 9, 9, 0, 8, 8, -1, 9, 11, 0, 14, 16, 1, 17, 17, 0, 16, 16, -1, 17, 19, 0, 22, 24, 1, 25, 25, 0, 24, 24, -1, 25, 27, 0, 30, 32, 1, 33, 33, 0, 32, 32, -1, 33, 35, 0, 38, 40, 1, 41, 41, 0, 40, 40, -1, 41, 43, 0, 46, 48, 1, 49, 49, 0, 48, 48, -1, 49, 51, 0, 54, 56, 1, 57, 57, 0, 56, 56, -1, 57, 59, 0, 62, 64 (list; graph; listen)

	OFFSET	`1,12`
	REFERENCES	`B. Cloitre, On strange predictible recursions, preprint 2006`
	FORMULA	`for n>=1 : a(6n)=4n-4-(-1)^n, a(6n+1)=0, a(6n+2)=4n-3+(-1)^n, a(6n+3)=4n-2+2(-1)^n, a(6n+4)=(-1)^n, a(6n+5)=4n-1+2*(-1)^n`
	CROSSREFS	`Cf. A104156, A119557, A119558.` `Sequence in context: A056459 A021330 A016598 this_sequence A011415 A141434 A077911` `Adjacent sequences: A119580 A119581 A119582 this_sequence A119584 A119585 A119586`
	KEYWORD	`sign`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 31 2006`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research