id:A100833 - OEIS Search Results

Search: id:A100833

Displaying 1-1 of 1 results found.

page 1

Smallest positive palindrome-free and square-free sequence.

+0
1

1, 2, 3, 1, 2, 4, 1, 2, 3, 1, 2, 5, 1, 2, 3, 1, 2, 4, 1, 2, 3, 1, 2, 6, 1, 2, 3, 1, 2, 4, 1, 2, 3, 1, 2, 5, 1, 2, 3, 1, 2, 4, 1, 2, 3, 1, 2, 7, 1, 2, 3, 1, 2, 4, 1, 2, 3, 1, 2, 5, 1, 2, 3, 1, 2, 4, 1, 2, 3, 1, 2, 6, 1, 2, 3, 1, 2, 4, 1, 2, 3, 1, 2, 5, 1, 2, 3, 1, 2, 4, 1, 2, 3, 1, 2, 8, 1, 2, 3, 1, 2, 4, 1, 2, 3 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(1)=1 and, for n>1, a(n) is the smallest positive integer such that no subsequence of two or more consecutive terms is a palindrome and no subsequence of 2k consecutive terms, k>=1, consists of two copies of the same subsequence.`
	CROSSREFS	`Sequence in context: A081514 A109206 A088422 this_sequence A097293 A026793 A072193` `Adjacent sequences: A100830 A100831 A100832 this_sequence A100834 A100835 A100836`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Jan 07 2005`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research