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.

A068173 Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 8.

Table of values

n a(n)
1 8
2 83
3 283
4 1283
5 12583
6 112583
7 1102583
8 11002583
9 110025803
10 1010025803
11 10100258303
12 101002258303
13 1010022508303
14 10100225080303
15 101002250803093
16 1010022508030793
17 10100225080303793
18 101002250803030793
19 1010022508030305793
20 10100224508030305793

List of values

[8, 83, 283, 1283, 12583, 112583, 1102583, 11002583, 110025803, 1010025803, 10100258303, 101002258303, 1010022508303, 10100225080303, 101002250803093, 1010022508030793, 10100225080303793, 101002250803030793, 1010022508030305793, 10100224508030305793]

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

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