Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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
OFFSET
1,1
COMMENTS
a(n) = 0 mostly. - David A. Corneth, Aug 29 2019
LINKS
FORMULA
Table[Min[IntegerDigits[Prime[w]]], {w, 1, 1000}]
PROG
(PARI) a(n) = vecmin(digits(prime(n))); \\ Michel Marcus, Jan 26 2017
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Labos Elemer, Apr 05 2001
EXTENSIONS
Offset 1 from Michel Marcus, Aug 29 2019
STATUS
approved