id:A076261 - OEIS Search Results

Search: id:A076261

Displaying 1-1 of 1 results found.

page 1

Triangle T(n,k) (n >= 2, 1 <= k <= n-1) read by rows, where T(n,k) is the number of words of length n in the free group on two generators that require exactly k multiplications for their formation.

+0
2

4, 0, 8, 0, 4, 12, 0, 0, 18, 14, 0, 0, 10, 44, 10, 0, 0, 0, 50, 74, 4 (list; table; graph; listen)

	OFFSET	`2,1`
	EXAMPLE	`T(4,2)=4 because we can generate each of aaaa,abab,baba,bbbb with just two multiplications: e.g. ab=ab, abab=abab.`
	CROSSREFS	`Cf. A076262.` `Sequence in context: A016682 A019111 A103554 this_sequence A070802 A114401 A073467` `Adjacent sequences: A076258 A076259 A076260 this_sequence A076262 A076263 A076264`
	KEYWORD	`more,nonn,tabl`
	AUTHOR	`Colin Mallows (colinm(AT)research.avayalabs.com), Oct 03 2002`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research