Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068172
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A068172
%S A068172 7,17,107,1087,10487,104087,1024087,10024087,100024087,1000124087,
%T A068172 10001240087,100012400837,1000124008327,10000124008327,100001124008327,
%U A068172 1000011224008327,10000110224008327,100001100224008327,1000010100224008327,
               10000101002240083271,100001010022400283271,1000010100221400283271
%N A068172 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) = 7.
%e A068172 The primes obtained by inserting/placing a digit in a(2) = 17 are 107,
               127, 137, etc...a(3)= 107 is the smallest.
%Y A068172 Cf. A068166, A068167, A068169, A068170, A068171.
%Y A068172 Sequence in context: A092057 A082738 A092340 this_sequence A067185 A063384 
               A165246
%Y A068172 Adjacent sequences: A068169 A068170 A068171 this_sequence A068173 A068174 
               A068175
%K A068172 base,nonn
%O A068172 1,1
%A A068172 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 25 2002
%E A068172 More terms from 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research