A094859 - OEIS

The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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; text; internal format)

	OFFSET	`1,2`
	COMMENTS	`Same as A094858 but now we can use an alphabet of size 3.`
	LINKS	`Table of n, a(n) for n=1..6.`
	CROSSREFS	`Sequence in context: A081419 A108858 A294688 * A267102 A122397 A339670` `Adjacent sequences: A094856 A094857 A094858 * A094860 A094861 A094862`
	KEYWORD	`nonn,more`
	AUTHOR	`Guenter Stertenbrink (Sterten(AT)aol.com), Jun 14 2004`
	STATUS	`approved`

Last modified April 14 04:20 EDT 2021. Contains 342941 sequences. (Running on oeis4.)