cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A075099 Minimal total number of multiplications needed to generate all words of length n in the free monoid on two generators.

Table of values

n	a(n)
1	0
2	4
3	11
4	20
5	42
6	75

List of values

[0, 4, 11, 20, 42, 75]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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