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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075100 Number of terms of length < n that are needed on the way to computing all words of length n in the free monoid with two generators. 2
0, 0, 3, 4, 10, 11 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

I believe a(2n) = a(n)+ 2^n. I think a(7) = 28.

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

Shouldn't a(2) = 2 ? Shouldn't a(3) = 5, because we need x, y, xx, xy, yy ? I'm confused! - N. J. A. Sloane, Dec 25 2006. Comment from Benoit Jubin, Jan 24 2009: I think the confusion comes from the fact that N. J. A. Sloane counts the one-letter words, so obtains always the written value plus 2. I think N. J. A. Sloane's way of counting is preferable, so the terms should be changed accordingly.

LINKS

Table of n, a(n) for n=1..6.

EXAMPLE

a(3) = 3 because we need only xx, xy, yy to generate each of xxx, xxy, xyx, yxx, xyy, yxy, yyx, yyy.

CROSSREFS

Cf. A075099, A003313, A124677.

Sequence in context: A128488 A226303 A117781 * A212440 A066861 A191192

Adjacent sequences:  A075097 A075098 A075099 * A075101 A075102 A075103

KEYWORD

hard,more,nonn,obsc

AUTHOR

Colin Mallows, Aug 31 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified March 22 22:17 EDT 2017. Contains 283901 sequences.