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.

A068167 Define an increasing sequence as follows. Given the first term, called the seed (which need not share the property of the remaining terms), subsequent terms are obtained by inserting at least one digit in the previous term so as to obtain the smallest number with the specified property. This is the prime sequence with the seed a(1) = 2.

Table of values

n a(n)
1 2
2 23
3 223
4 1223
5 10223
6 102023
7 1020023
8 10200263
9 102002603
10 1020026303
11 10200226303
12 102002263031
13 1020002263031
14 10200022363031
15 102000223263031
16 1020000223263031
17 10200002232630131
18 102000022326301313
19 1020000222326301313
20 10200002223236301313

List of values

[2, 23, 223, 1223, 10223, 102023, 1020023, 10200263, 102002603, 1020026303, 10200226303, 102002263031, 1020002263031, 10200022363031, 102000223263031, 1020000223263031, 10200002232630131, 102000022326301313, 1020000222326301313, 10200002223236301313]

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

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