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.

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

Table of values

n a(n)
0 0
1 2
2 6
3 13
4 27

List of values

[0, 2, 6, 13, 27]

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

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