id:A057211 - OEIS Search Results

Search: id:A057211

Displaying 1-1 of 1 results found.

page 1

n-th run has length n.

+0
7

1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,1`
	REFERENCES	`K. H. Rosen, Discrete Mathematics and its Applications, 1999, Fourth Edition, page 79, exercise 10 (g).`
	FORMULA	`a(n) = (1-(-1)^A002024(n))/2, where A002024(n)=round(sqrt(2n)). - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 23 2003` `Also a(n) = A000035(A002024(n)) = A002024(n) mod 2 = A002024(n)-2floor(A002024(n)/2) - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 23 2003`
	MAPLE	`A002024 := n->round(sqrt(2*n)):A057211 := n->(1-(-1)^A002024(n))/2;`
	CROSSREFS	`Cf. A057212.` `Sequence in context: A089012 A083035 A051341 this_sequence A120531 A106665 A004609` `Adjacent sequences: A057208 A057209 A057210 this_sequence A057212 A057213 A057214`
	KEYWORD	`nonn`
	AUTHOR	`Ben Tyner (tyner(AT)phys.ufl.edu), Sep 27 2000`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research