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.

A320890 a(1) = 11. For all subsequent terms a(n), take a(n-1) and substitute for the k-th digit the binary number of times that digit has appeared in a(n-1), reading left to right from the 1st to k-th digit.

Table of values

n a(n)
1 11
2 110
3 1101
4 110111
5 110111100101
6 11011110010111010111111001000
7 1101111001011101011111100100010011010101101111011001101111011111000010001111100010010100110101011

List of values

[11, 110, 1101, 110111, 110111100101, 11011110010111010111111001000, 1101111001011101011111100100010011010101101111011001101111011111000010001111100010010100110101011]

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

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