Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088115
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A088115
%S A088115 0,2,3,31,5,0,7,71,0,73,83,0,67,59,0,97,89,0,991,983,0,967,977,0,997,
%T A088115 9791,0,9973,9929,0,9967,9887,0,99961,8999,0,99991,99929,0,99877,99689,
%U A088115 0,98899,99989,0,999883,999983,0,999769,999959,0,999979,989999,0
%N A088115 a(n) = largest prime using least number of possible digits with a digit 
               sum n, or 0 if no such number exists. E.g. if n > 9 and there are 
               no two digit primes with a given digit sum n then three digit numbers 
               are explored and so on.
%C A088115 a(26) = 9719 as 989,899 both are composite. This is the first genuine 
               case in which the number of digits used is more than Floor[n/9] +1 
               (after single digit composite even numbers 4 and 8).
%e A088115 a(7) = 7.
%e A088115 a(8) = 71 as 8 is not a prime.
%Y A088115 Sequence in context: A095927 A137981 A110351 this_sequence A048986 A093712 
               A035514
%Y A088115 Adjacent sequences: A088112 A088113 A088114 this_sequence A088116 A088117 
               A088118
%K A088115 base,nonn
%O A088115 1,2
%A A088115 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 25 2003
%E A088115 More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jul 25 
               2005

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


AT&T Labs Research