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.

A068171 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) = 6.

Table of values

n a(n)
1 6
2 61
3 461
4 3461
5 33461
6 332461
7 3132461
8 31320461
9 313204061
10 3130204061
11 23130204061
12 231302004061
13 2131302004061
14 21313020024061
15 213130200240161
16 2131230200240161
17 12131230200240161
18 121312302002401613
19 1210312302002401613
20 12103123020020401613
21 121031230200203401613
22 1210312300200203401613

List of values

[6, 61, 461, 3461, 33461, 332461, 3132461, 31320461, 313204061, 3130204061, 23130204061, 231302004061, 2131302004061, 21313020024061, 213130200240161, 2131230200240161, 12131230200240161, 121312302002401613, 1210312302002401613, 12103123020020401613, 121031230200203401613, 1210312300200203401613]

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

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