id:A026610 - OEIS Search Results

Search: id:A026610

Displaying 1-1 of 1 results found.

page 1

a(n) = number of 1's between n-th 2 and (n+1)st 2 in A026600.

+0
1

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

	OFFSET	`1,2`
	CROSSREFS	`Sequence in context: A091182 A001822 A112553 this_sequence A094451 A056562 A135220` `Adjacent sequences: A026607 A026608 A026609 this_sequence A026611 A026612 A026613`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research