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.

A246536 a(n) = number of strings (including the empty string) over an alphabet of size n that do not have any substrings of length > 1 that appear more than once in the string.

Table of values

n a(n)
1 3
2 25
3 1885
4 3636297
5 327094648711

List of values

[3, 25, 1885, 3636297, 327094648711]

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

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