id:A025142 - OEIS Search Results

Search: id:A025142

Displaying 1-1 of 1 results found.

page 1

Unique sequence a such that a(1) = 1 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 A025143.

+0
6

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

	OFFSET	`1,3`
	REFERENCES	`Mathematische Semesterberichte 44 94 1997.`
	CROSSREFS	`Sequence in context: A001817 A091954 A080236 this_sequence A074265 A002636 A087974` `Adjacent sequences: A025139 A025140 A025141 this_sequence A025143 A025144 A025145`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research