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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060420 Least decimal digit in n-th prime. 2
 2, 3, 5, 7, 1, 1, 1, 1, 2, 2, 1, 3, 1, 3, 4, 3, 5, 1, 6, 1, 3, 7, 3, 8, 7, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 1, 2, 1, 2, 2, 0, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 1, 1, 1, 3, 3, 3, 4, 4, 1, 3, 4, 4, 4, 1, 4, 0, 0, 1, 2, 1, 4, 5, 3, 5, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = 0 mostly. - David A. Corneth, Aug 29 2019 LINKS David A. Corneth, Table of n, a(n) for n = 1..10000 FORMULA Table[Min[IntegerDigits[Prime[w]]], {w, 1, 1000}] PROG (PARI) a(n) = vecmin(digits(prime(n))); \\ Michel Marcus, Jan 26 2017 CROSSREFS Cf. A054054, A054055, A054052. Sequence in context: A109905 A230200 A113493 * A077648 A033308 A134690 Adjacent sequences: A060417 A060418 A060419 * A060421 A060422 A060423 KEYWORD base,easy,nonn AUTHOR Labos Elemer, Apr 05 2001 EXTENSIONS Offset 1 from Michel Marcus, Aug 29 2019 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 December 7 22:27 EST 2022. Contains 358671 sequences. (Running on oeis4.)