The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A104226 Product of the smallest and largest n-digit primes. 0
 14, 1067, 100697, 10062757, 1000609937, 100001299949, 10000020999973, 1000001789999791, 100000000699999559, 10000000036999999769, 1000000001669999999563, 100000000001899999999967 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Chris Caldwell, The First 10,000 Primes. EXAMPLE The first term is 14 since it is the product of 2 and 7, which are the smallest and largest 1-digit primes. MATHEMATICA NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; PrevPrim[n_] := Block[{k = n - 1}, While[ !PrimeQ[k], k-- ]; k]; f[n_] := NextPrim[10^(n - 1)]*PrevPrim[10^n]; Array[f, 13] (* Robert G. Wilson v, Feb 10 2006 *) CROSSREFS Sequence in context: A227205 A297766 A160011 * A282272 A208395 A132504 Adjacent sequences:  A104223 A104224 A104225 * A104227 A104228 A104229 KEYWORD nonn,base AUTHOR Parthasarathy Nambi, Apr 01 2005 EXTENSIONS More terms from Robert G. Wilson v, Feb 10 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 12 06:02 EDT 2022. Contains 356067 sequences. (Running on oeis4.)