login
A165227
Iteratively parse Pi until 9 of 10 digits have been found, with the remaining "lost" digit = the next term in the sequence.
0
0, 1, 0, 6, 5, 9, 3, 5, 7, 6, 6, 7, 5, 0, 9, 7, 7, 8, 9, 3, 0, 7, 7, 8, 4, 4, 9, 0, 6, 5, 7, 8, 5, 4, 2, 9, 9, 4, 5, 7, 4, 7, 7, 5, 4, 6, 4, 7, 7, 4, 9, 2, 1, 4, 4, 3, 4, 0, 4, 4, 0, 6, 4, 6, 8, 5, 9, 3, 0, 0, 1, 5, 3, 7, 6, 5, 9, 8, 4, 1, 8, 1, 2, 1, 3, 5, 8, 8, 0, 1, 0, 7, 3, 2, 5, 1, 2, 1, 6, 7, 5, 6, 8, 0, 7
OFFSET
1,4
COMMENTS
a(176)=0, and it has the distinction of being the first "best case" scenario in which 9 out of 9 digits are distinct. Occurs at position 3312: "763594218". a(10562)=7, and it has the distinction of being the most elusive case in the first million digits of Pi, eluding 81 digits beginning at position 204249: "206589689495098835545433034480634690683626426926225260480503822296566585644546381".
EXAMPLE
a(1) = 0 because every digit except 0 occurs in the initial 14 digits of Pi: 31415926535897.
a(2) = 1 because every digit except 1 occurs in the next 19 digits of Pi: 9323846264338327950.
a(3) = 0 because every digit except 0 occurs in the next 16 digits of Pi: 2884197169399375.
a(4) = 6 because every digit except 6 occurs in the next 16 digits of Pi: 1058209749445923.
a(5) = 5 because every digit except 5 occurs in the next 22 digits of Pi: 0781640628620899862803.
CROSSREFS
Sequence in context: A011284 A196760 A199949 * A242761 A200477 A269768
KEYWORD
easy,nonn,base
AUTHOR
Gil Broussard, Sep 09 2009
STATUS
approved