Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068167
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068167 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) = 2. +0
8
2, 23, 223, 1223, 10223, 102023, 1020023, 10200263, 102002603, 1020026303, 10200226303, 102002263031, 1020002263031, 10200022363031, 102000223263031, 1020000223263031, 10200002232630131, 102000022326301313 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The primes obtained by inserting/placing a digit in a(2) = 23 are 223,233,239,263,283,293 etc. a(3) = 223 is the smallest.

CROSSREFS

Cf. A068166.

Sequence in context: A062600 A069590 A024028 this_sequence A030456 A069837 A069629

Adjacent sequences: A068164 A068165 A068166 this_sequence A068168 A068169 A068170

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 25 2002

EXTENSIONS

Corrected and extended by Robert Gerbicz (gerbicz(AT)freemail.hu), Sep 06 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research