A060420 Least decimal digit in n-th prime.

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

Author

Labos Elemer, Apr 05 2001

Keywords

• base
• easy
• nonn

Comments

a(n) = 0 mostly. - David A. Corneth, Aug 29 2019

Links

• David A. Corneth, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A054054, A054055, A054052.

Programs

PARI

a(n) = vecmin(digits(prime(n))); \\ Michel Marcus, Jan 26 2017

Formula

Table[Min[IntegerDigits[Prime[w]]], {w, 1, 1000}]

Extensions

Offset 1 from Michel Marcus, Aug 29 2019