OFFSET
2,2
COMMENTS
The number of digits that must be read so as to reach the first appearance of a digit a(n) is A316478(n).
LINKS
Jon E. Schoenfield, Table of n, a(n) for n = 2..5000
EXAMPLE
The decimal (i.e., base-10) expansion of Pi is
3.14159265358979323846264338327950...
in which each of the digits 1..9 appears before the first appearance of a digit 0, so a(10) = 0.
Using the characters a..f to represent 10..15, the hexadecimal (i.e., base-16) expansion of Pi is
3.243f6a8885a308d313198a2e03707344a4093822299f31d0
082efa98ec4e6c89452821e638d01377b...
in which each of the digits 0..a and c..f appears before the first appearance of a digit b, so a(16) = 11.
MATHEMATICA
a[n_] := Block[{r, k=2}, While[n > Length@ Union[r = RealDigits[Pi, n, k n][[1]]], k++]; r[[Max@ Flatten[Position[r, #, 1, 1] & /@ Range[0, n-1]]]]]; Array[a, 71, 2] (* Giovanni Resta, Jul 08 2018 *)
CROSSREFS
Cf. A316478 (Number of base-n digits of Pi that must be read so as to encounter at least one of each digit, 0..n-1).
KEYWORD
nonn,base
AUTHOR
Jon E. Schoenfield, Jul 06 2018
STATUS
approved