A094859 - OEIS

This site is supported by donations to The OEIS Foundation.

A094859

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

1, 2, 3, 4, 6, 10 (list; graph; refs; listen; history; internal format)

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 14:37 EST 2012. Contains 205822 sequences.