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.

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

Table of values

n a(n)
1 1
2 2
3 2
4 4
5 4
6 6
7 8
8 11
9 15
10 20
11 26
12 36
13 51

List of values

[1, 2, 2, 4, 4, 6, 8, 11, 15, 20, 26, 36, 51]