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.

Original entry on oeis.org

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

Views

Author

Amarnath Murthy, Feb 25 2002

Keywords

Examples

			The primes obtained by inserting/placing a digit in a(2) = 61 are 461, 619, 641, etc...a(3) = 461 is the smallest.
		

Crossrefs

Extensions

More terms from Robert Gerbicz, Sep 06 2002
Definition edited by Harvey P. Dale, Feb 28 2023