%I M1747 N0692 #21 Feb 07 2021 21:10:31
%S 2,7,18,28,182,845,904,5235,36028,74713,526624,977572,4709369,9959574,
%T 96696762,7724076630,35354759457,138217852516,642742746639,
%U 1932003059921,8174135966290,43572900334295,260595630738132,328627943490763,2338298807531952,5101901157383418
%N Increasing blocks of digits of e.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Michael S. Branicky, <a href="/A001114/b001114.txt">Table of n, a(n) for n = 1..1000</a>
%H G. W. Reitwiesner, <a href="https://doi.org/10.2307/2002695">An ENIAC determination of pi and e to more than 2000 decimal places</a>, Mathematical Tables and Other Aids to Computation, 4 (1950), 11-15.
%H D. Shanks and J. W. Wrench, Jr., <a href="https://doi.org/10.2307/2004403">Calculation of e to 100,000 decimals</a>, Math. Comp., 23 (1969), 679-680.
%o (Python)
%o from sympy import E
%o def aupto(digit_limit):
%o alst, estr = [], str(E.n(digit_limit)).replace(".", "")
%o prevlen, prevstr, suffix = 0, "", estr
%o while len(suffix) > prevlen + 1:
%o if suffix[:prevlen] > prevstr: idx = prevlen
%o else: idx = prevlen + 1
%o while suffix[idx] == '0':
%o idx += 1
%o if idx > len(suffix): break # end of string reached
%o anstr, suffix = suffix[:idx], suffix[idx:]
%o prevstr, prevlen = anstr, len(anstr)
%o assert anstr[0] != '0'
%o alst.append(int(anstr))
%o return alst
%o print(aupto(220)) # _Michael S. Branicky_, Feb 07 2021
%K nonn,base
%O 1,1
%A _N. J. A. Sloane_
%E More terms from _Jon E. Schoenfield_, Mar 24 2010
%E a(24) and beyond from _Michael S. Branicky_, Feb 07 2021