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.

A094863 Maximal number of longest common subsequences between any two strings of length n (Version 2).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 7
6 10
7 19
8 28

List of values

[1, 2, 3, 4, 7, 10, 19, 28]