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.

A059458 A binary sequence: a(1) = 10 (2 in decimal) and a(n+1) is obtained by trying to complement just one bit of a(n), starting with the least significant bit, until a new prime is reached.

Table of values

n a(n)
1 10
2 11
3 111
4 101
5 1101
6 11101
7 11111
8 10111
9 10011
10 10001
11 10000000010001
12 10000001010001
13 10100001010001
14 100001010001
15 100001010011
16 1010011
17 1000011
18 1000111
19 1001111
20 10001001111
21 10000001111
22 10000000111
23 10000100111

List of values

[10, 11, 111, 101, 1101, 11101, 11111, 10111, 10011, 10001, 10000000010001, 10000001010001, 10100001010001, 100001010001, 100001010011, 1010011, 1000011, 1000111, 1001111, 10001001111, 10000001111, 10000000111, 10000100111]

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

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