id:A026609 - OEIS Search Results

Search: id:A026609

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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, 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, 1, 1, 0, 2, 0, 2, 0, 2, 1, 1 (list; graph; listen)

	OFFSET	`1,1`
	CROSSREFS	`Sequence in context: A140883 A064744 A135997 this_sequence A090340 A117162 A146061` `Adjacent sequences: A026606 A026607 A026608 this_sequence A026610 A026611 A026612`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research