id:A094859 - OEIS Search Results

Search: id:A094859

Displaying 1-1 of 1 results found.

page 1

Maximal number of longest common subsequences between any two ternary strings of length n (Version 2).

+0
2

1, 2, 3, 4, 6, 10 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Same as A094858 but now we can use an alphabet of size 3.`
	CROSSREFS	`Sequence in context: A103481 A081419 A108858 this_sequence A122397 A047417 A066936` `Adjacent sequences: A094856 A094857 A094858 this_sequence A094860 A094861 A094862`
	KEYWORD	`nonn,more`
	AUTHOR	`Guenter Stertenbrink (Sterten(AT)aol.com), Jun 14 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.