id:A025143 - OEIS Search Results

Search: id:A025143

Displaying 1-1 of 1 results found.

page 1

Unique sequence a such that a(1) = 2 and r(r(a)) = a != r(a), where for any sequence s of 1's and 2's, r(s(n) := length of n-th run of same symbols in s; r(a) is sequence A025142.

+0
7

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

	OFFSET	`1,1`
	REFERENCES	`C. Kimberling, Problem 90: Run-length sequences, Mathematische Semesterberichte, 44 (1997) 94-95.`
	CROSSREFS	`Differs from A014675 in many entries starting at entry 8.` `Sequence in context: A123018 A100429 A049710 this_sequence A080634 A109925 A001468` `Adjacent sequences: A025140 A025141 A025142 this_sequence A025144 A025145 A025146`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.070 seconds

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

AT&T Labs Research