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.

A215254 Consider numbers m in the range 2^n <= m < 2^(n+1); the smallest A215244(m) in this range is k=A215245(n); a(n) = binary representation of m for the first time this k appears.

Table of values

n a(n)
0 1
1 10
2 100
3 1001
4 10010
5 100101
6 1001101
7 10010110
8 101001101
9 1001011001
10 10010110010
11 100101100101
12 1001101001101
13 10010110010110
14 101001101001101
15 1001011001011001
16 10010110010110010
17 100101100101100101

List of values

[1, 10, 100, 1001, 10010, 100101, 1001101, 10010110, 101001101, 1001011001, 10010110010, 100101100101, 1001101001101, 10010110010110, 101001101001101, 1001011001011001, 10010110010110010, 100101100101100101]