Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Oct 03 2016 16:32:11
%S 0,0,6,7,3,1,6,7,0,7,8,9,3,1,7,4,1,6,9,8,8,2,9,5,2,1,7,2,6,7,9,6,4,4,
%T 4,6,4,8,9,0,1,4,3,6,5,5,4,1,8,1,2,3,3,8,0,0,3,5,0,1,6,7,5,5,0,7,3,1,
%U 5,7,7,3,6,0,1,7,3,3,9,0,2,3,0,4,5,3,0,9,0,8,2,6,5,2,2,4,0,0,0,5
%N Separate the digits of Pi into smallest blocks such that each block contains all digits from 0 to 9. Sequence gives the last digits of blocks from left to right.
%H Alois P. Heinz, <a href="/A277135/b277135.txt">Table of n, a(n) for n = 1..10000</a>
%e The first substring of Pi containing all 10 digits is 3.14159265358979323846264338327950, so a(1) = 0.
%e The next substring of Pi is 288419716939937510, so a(2) = 0.
%e The next substring of Pi is 5820974944592307816, so a(3) = 6.
%e The next substring of Pi is 406286208998628034825342117, so a(4) = 7.
%Y Cf. A000796, A104781, A109407, A277140.
%K nonn,base
%O 1,3
%A _Bobby Jacobs_, Oct 01 2016