Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075099
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075099 Minimal total number of multiplications needed to generate all words of length n in the free monoid on two generators. +0
3
0, 4, 11, 20, 42, 75 (list; graph; listen)
OFFSET

1,2

COMMENT

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 this_sequence A161975 A008052 A016438

Adjacent sequences: A075096 A075097 A075098 this_sequence A075100 A075101 A075102

KEYWORD

hard,more,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research