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.

A068169 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) = 4.

Table of values

n a(n)
1 4
2 41
3 241
4 2141
5 21341
6 213461
7 2123461
8 21123461
9 211234561
10 2112343561
11 21123043561
12 211230043561
13 2112030043561
14 21112030043561
15 211120030043561
16 2110120030043561
17 21101020030043561
18 211010200230043561
19 2110102002300430561
20 21010102002300430561

List of values

[4, 41, 241, 2141, 21341, 213461, 2123461, 21123461, 211234561, 2112343561, 21123043561, 211230043561, 2112030043561, 21112030043561, 211120030043561, 2110120030043561, 21101020030043561, 211010200230043561, 2110102002300430561, 21010102002300430561]

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

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