Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080437
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A080437
%S A080437 2,3,5,7,101,103,107,109,223,229,311,307,401,433,457,503,509,601,607,
%T A080437 701,733,709,823,809,907,10061,10093,10007,10009,10103,10247,10301,
%U A080437 10337,10369,10429,10501,10567,10613,10607,10723,10709,10831,11941
%N A080437 For n < 10, a(n) = n-th prime. For n > 10, let m = n-th prime. If m is 
               a k-digit prime then a(n) = smallest prime obtained by inserting 
               digits between every pair of digits of m. There are (k-1) places 
               where digit insertion takes place and a(n) contains at least 2k-1 
               digits.
%H A080437 Matthew M. Conroy, <a href="b080437.txt">Table of n, a(n) for n = 1..168</
               a>
%H A080437 Matthew M. Conroy, <a href="http://www.madandmoonly.com/doctormatt/">
               Home Page</a> (Listed in lieu of email address)
%Y A080437 Cf. A080436.
%Y A080437 Sequence in context: A068827 A076406 A092909 this_sequence A092908 A050784 
               A030150
%Y A080437 Adjacent sequences: A080434 A080435 A080436 this_sequence A080438 A080439 
               A080440
%K A080437 base,nonn
%O A080437 1,1
%A A080437 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 21 2003
%E A080437 More terms from Matthew M. Conroy Sep 18 2007

    
page 1

Search completed in 0.001 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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research