id:A109294 - OEIS Search Results

Search: id:A109294

Displaying 1-1 of 1 results found.

page 1

Base 3 analogue of A018737. Start with S = {}. For m = 0, 1, 2, 3, ... let u be the ternary expansion of m. If u is not a substring of S, append the minimal number of ternary digits to S to remedy this. Sequence gives S.

+0
1

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

	OFFSET	`0,3`
	CROSSREFS	`Cf. A108737.` `Sequence in context: A113446 A121450 A132004 this_sequence A132966 A037897 A054070` `Adjacent sequences: A109291 A109292 A109293 this_sequence A109295 A109296 A109297`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Jun 24 2005`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research