[go: up one dir, main page]

login
A001114
Increasing blocks of digits of e.
(Formerly M1747 N0692)
1
2, 7, 18, 28, 182, 845, 904, 5235, 36028, 74713, 526624, 977572, 4709369, 9959574, 96696762, 7724076630, 35354759457, 138217852516, 642742746639, 1932003059921, 8174135966290, 43572900334295, 260595630738132, 328627943490763, 2338298807531952, 5101901157383418
OFFSET
1,1
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
G. W. Reitwiesner, An ENIAC determination of pi and e to more than 2000 decimal places, Mathematical Tables and Other Aids to Computation, 4 (1950), 11-15.
D. Shanks and J. W. Wrench, Jr., Calculation of e to 100,000 decimals, Math. Comp., 23 (1969), 679-680.
PROG
(Python)
from sympy import E
def aupto(digit_limit):
alst, estr = [], str(E.n(digit_limit)).replace(".", "")
prevlen, prevstr, suffix = 0, "", estr
while len(suffix) > prevlen + 1:
if suffix[:prevlen] > prevstr: idx = prevlen
else: idx = prevlen + 1
while suffix[idx] == '0':
idx += 1
if idx > len(suffix): break # end of string reached
anstr, suffix = suffix[:idx], suffix[idx:]
prevstr, prevlen = anstr, len(anstr)
assert anstr[0] != '0'
alst.append(int(anstr))
return alst
print(aupto(220)) # Michael S. Branicky, Feb 07 2021
CROSSREFS
Sequence in context: A268837 A104310 A301325 * A107615 A195605 A184096
KEYWORD
nonn,base
EXTENSIONS
More terms from Jon E. Schoenfield, Mar 24 2010
a(24) and beyond from Michael S. Branicky, Feb 07 2021
STATUS
approved