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.

A327233 Largest integer k < 10^(2^n+n) such that the set of all n consecutive digits of k equals the set of 0 to 2^n-1 written as n-digit binary numbers.

Table of values

n a(n)
1 10
2 11001
3 1110100011
4 1111011001010000111
5 111110111001101011000101001000001111
6 111111011110011101011100011011010011001011000010101000100100000011111

List of values

[10, 11001, 1110100011, 1111011001010000111, 111110111001101011000101001000001111, 111111011110011101011100011011010011001011000010101000100100000011111]