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.

A093382 a(n) = length k of longest binary sequence x(1) ... x(k) such that for no n <= i < j <= k/2 is x(i) ... x(2i) a subsequence of x(j) ... x(2j).

Table of values

n a(n)
1 11
2 31
3 199

List of values

[11, 31, 199]

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

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