|
|
A277135
|
|
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.
|
|
2
|
|
|
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, 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, 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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
EXAMPLE
|
The first substring of Pi containing all 10 digits is 3.14159265358979323846264338327950, so a(1) = 0.
The next substring of Pi is 288419716939937510, so a(2) = 0.
The next substring of Pi is 5820974944592307816, so a(3) = 6.
The next substring of Pi is 406286208998628034825342117, so a(4) = 7.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|