OFFSET
1,1
COMMENTS
a(176)=9, and it is the first "best case" scenario in which 9 out of 9 digits are distinct. Occurs at position 3312: "763594218". a(10562)=81, and it the longest case in the first million digits of Pi, with "7" eluding 81 digits beginning at position 204249: "206589689495098835545433034480634690683626426926225260480503822296566585644546381".
EXAMPLE
a(1) = 14 because every digit except 0 occurs in the initial 14 digits of Pi: 31415926535897.
a(2) = 19 because every digit except 1 occurs in the next 19 digits of Pi: 9323846264338327950.
a(3) = 16 because every digit except 0 occurs in the next 16 digits of Pi: 2884197169399375.
a(4) = 16 because every digit except 6 occurs in the next 16 digits of Pi: 1058209749445923.
a(5) = 22 because every digit except 5 occurs in the next 22 digits of Pi: 0781640628620899862803.
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
Gil Broussard, Sep 09 2009
STATUS
approved