This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076449 Least number which has n embedded primes. 4
 1, 2, 25, 13, 37, 107, 127, 113, 167, 1027, 179, 137, 1036, 1127, 1013, 1137, 1235, 1136, 1123, 1037, 1139, 1079, 10124, 10126, 1349, 1279, 11237, 3479, 10699, 1367, 10179, 1379, 10127, 10079, 10138, 10123, 10234, 10235, 10247, 10339, 10267 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Smallest m such that A075053(m) = n. Keith conjectures that a(n) always exists and reports that he has checked this for n <= 66. - N. J. A. Sloane, Jan 25 2008 LINKS C. K. Caldwell, The Prime Glossary, Primeval Number J. P. Delahaye, Primes Hunters, 1379 is very primeval (in French) M. Keith, Integers containing many embedded primes W. Schneider, PrimevalNumbers G. Villemin's Almanach of Numbers, Nombre Primeval de Mike Keith EXAMPLE a(10)=179 because 179 is the least number harbouring ten primes (namely 7, 17, 19, 71, 79, 97, 179, 197, 719, 971). MATHEMATICA (* first do *) Needs["DiscreteMath`Combinatorica`"] (* then *) f[n_] := Length[ Select[ FromDigits /@ Flatten[ Permutations /@ Subsets[ IntegerDigits[ n]], 1], PrimeQ[ # ] &]]; t = Table[0, {50}]; Do[ a = f[n]; If[a < 50 && t[[a + 1]] == 0, t[[a + 1]] = n], {n, 12500}]; t (from Robert G. Wilson v Feb 12 2005) CROSSREFS Cf. A075053. A072857 gives a similar sequence. Sequence in context: A065665 A161575 A036502 * A153811 A101962 A092045 Adjacent sequences:  A076446 A076447 A076448 * A076450 A076451 A076452 KEYWORD base,nonn,changed AUTHOR Lekraj Beedassy, Nov 07 2002 EXTENSIONS Edited by Robert G. Wilson v, Nov 24 2002 Keith link repaired by Charles R Greathouse IV, Aug 13 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .