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.

A068172 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) = 7.

Table of values

n a(n)
1 7
2 17
3 107
4 1087
5 10487
6 104087
7 1024087
8 10024087
9 100024087
10 1000124087
11 10001240087
12 100012400837
13 1000124008327
14 10000124008327
15 100001124008327
16 1000011224008327
17 10000110224008327
18 100001100224008327
19 1000010100224008327
20 10000101002240083271
21 100001010022400283271
22 1000010100221400283271

List of values

[7, 17, 107, 1087, 10487, 104087, 1024087, 10024087, 100024087, 1000124087, 10001240087, 100012400837, 1000124008327, 10000124008327, 100001124008327, 1000011224008327, 10000110224008327, 100001100224008327, 1000010100224008327, 10000101002240083271, 100001010022400283271, 1000010100221400283271]

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

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