OFFSET
1,1
COMMENTS
Start with decimal expansion of Pi: s0=3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3,2,3,8,4,6,2,6,4,3,3,8,3,2,7,9,5,0,2,8,8,4,1,9,7,1,6,9,3,9,9,3,7,5,1,0,5,8,2,0,9,7,4,9,4,4,5,...
Divide s0 to the sections with the same final digits: s={3,1,4,1,5,9,2,6,5,3}, {5,8,9,7,9,3,2,3,8,4,6,2,6,4,3,3,8,3,2,7,9,5}, {0,2,8,8,4,1,9,7,1,6,9,3,9,9,3,7,5,1,0}, {5,8,2,0,9,7,4,9,4,4,5},...
Then A104865(n) = length of [s(n)]: 10,22,19,11,...
A104866(n) = final digits of [s(n)]: 3,5,0,5,...
MATHEMATICA
pi = RealDigits[Pi, 10, 1000][[1]]; lst = {}; f := Block[{k = Position[pi, pi[[1]]][[2, 1]]}, pi = Drop[pi, k]; k]; Do[lst = {lst, f}, {n, 80}]; Flatten[lst] (* Robert G. Wilson v, Mar 29 2005 *)
PROG
(Python)
from sympy import S
# download https://stuff.mit.edu/afs/sipb/contrib/pi/pi-billion.txt, then
# with open('pi-billion.txt', 'r') as f: pi_digits = f.readline()
pi_digits = str(S.Pi.n(2*10**5))[:-1] # alternative to above
pi_digits = pi_digits.replace(".", "")
def aupton(terms):
alst, idx = [], 0
for n in range(1, terms+1):
digit, idx, c = pi_digits[idx], idx+1, 2
while pi_digits[idx] != digit:
idx += 1; c += 1
assert idx < len(pi_digits), "increase precision"
alst.append(c); idx += 1
return alst
print(aupton(84)) # Michael S. Branicky, Oct 22 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Zak Seidov, Mar 29 2005
EXTENSIONS
More terms from Robert G. Wilson v, Mar 29 2005
STATUS
approved