id:A156747 - OEIS Search Results

Search: id:A156747

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 0, -1, 0, 2, 2, 3, 2, 2, 0, -1, 2, 0, 2, -1, 0, 4, 4, 7, 6, 8, 6, 7, 4, 4, 0, -1, 4, 2, 6, 3, 6, 2, 4, -1, 0, 6, 6, 11, 10, 14, 12, 15, 12, 14, 10, 11, 6, 6, 0, -1, 6, 4, 10, 7, 12, 8, 12, 7, 10, 4, 6, -1, 0, 8, 8, 15, 14, 20, 18, 23, 20, 24, 20, 23, 18, 20, 14, 15, 8, 8, 0, -1, 8, 6, 14, 11 (list; graph; listen)

	OFFSET	`1,6`
	COMMENT	`A jumping flea sequence of order 3 (take a look at the graph and see A104156 for a sequence of order 2).`
	FORMULA	`The sequence can be determined. For instance for n>=1 a(n^2+(3/2)*(1-(-1)^n))=-1, for n>=5 a(n^2-2+(1+(-1)^n)/2)=0 and between zeros there are simple patterns.`
	CROSSREFS	`Sequence in context: A093420 A104897 A097510 this_sequence A138774 A156988 A115312` `Adjacent sequences: A156744 A156745 A156746 this_sequence A156748 A156749 A156750`
	KEYWORD	`sign`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 14 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research