Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077391
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A077391
%S A077391 2,11,127,1021,10313,100237
%N A077391 Smallest n-digit prime which leaves a prime at every step if most significant 
               digit and least significant digit are deleted until a one digit or 
               two digit prime is obtained, or 0 if no such prime exists.
%C A077391 Conjecture: No term is zero.
%e A077391 a(6) = 100237: this is the smallest 6-digit number such that deleting 
               MSD and LSD yields prime at every step, i.e. 100237, 0023, 02 all 
               are primes.
%Y A077391 Cf. A077390.
%Y A077391 Sequence in context: A155928 A001946 A112864 this_sequence A104087 A154596 
               A066382
%Y A077391 Adjacent sequences: A077388 A077389 A077390 this_sequence A077392 A077393 
               A077394
%K A077391 base,nonn
%O A077391 1,1
%A A077391 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 07 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