Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068173
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068173 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) = 8. +0
2
8, 83, 283, 1283, 12583, 112583, 1102583, 11002583, 110025803, 1010025803, 10100258303, 101002258303, 1010022508303, 10100225080303, 101002250803093, 1010022508030793, 10100225080303793, 101002250803030793 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The primes obtained by inserting/placing a digit in a(2) = 89 are 389,809, etc...a(3)= 389 is the smallest.

CROSSREFS

Cf. A068166, A068167, A068169, A068170, A068171, A068172.

Sequence in context: A080811 A073699 A163191 this_sequence A069635 A069620 A039939

Adjacent sequences: A068170 A068171 A068172 this_sequence A068174 A068175 A068176

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research