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.

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

Table of values

n a(n)
1 1
2 2
3 4
4 10
5 24
6 46
7 100
8 225
9 525
10 1225
11 3136
12 7056
13 17640
14 44100
15 108900
16 261360
17 637065
18 1656369
19 4008004
20 10020010
21 25050025
22 64128064
23 155739584
24 393853824
25 1012766976

List of values

[1, 2, 4, 10, 24, 46, 100, 225, 525, 1225, 3136, 7056, 17640, 44100, 108900, 261360, 637065, 1656369, 4008004, 10020010, 25050025, 64128064, 155739584, 393853824, 1012766976]