login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075099 Minimal total number of multiplications needed to generate all words of length n in the free monoid on two generators. 2
0, 4, 11, 20, 42, 75 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Benoit Jubin (Jan 24 2009) suggests replacing "monoid" in the definition by "semigroup".

I believe a(2n) = a(n) + 2^(2n). I guess a(7) = 156.

EXAMPLE

a(3)=11 because each of xxx,xxy,xyx,xyy,yxx,yxy,yyx,yyy can be obtained in one step from xx,xy,yy and it takes three multiplications to produce xx, xy, yy.

CROSSREFS

Cf. A075100, A124677 (another version).

Sequence in context: A038413 A008174 A008262 * A161975 A008052 A016438

Adjacent sequences:  A075096 A075097 A075098 * A075100 A075101 A075102

KEYWORD

hard,more,nonn

AUTHOR

Colin Mallows (colinm(AT)research.avayalabs.com), Aug 31 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.