login

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”).

A371863
Records in A370748.
3
1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 179308, 589204, 3162450, 7653120, 8469210, 9481036, 10543967, 12869537, 14527380, 16927083, 17940836, 20865319, 23874159, 31527049, 36594278, 50189734, 57624138, 69871345, 74136950, 86021453
OFFSET
1,2
COMMENTS
a(88) is the highest possible term in A370748.
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..88
PROG
(Python) # uses imports, functions in A370748
def agen(): # generator of terms
record = -1
for i, v in enumerate(A370748gen()):
if v > record:
idx, record = i, v
yield record
print(list(islice(agen(), 36))) # Michael S. Branicky, Apr 09 2024
CROSSREFS
Cf. A370748, A371864 (indices of records).
Sequence in context: A274865 A364040 A050732 * A260814 A274864 A274863
KEYWORD
nonn,base,fini,full
AUTHOR
Michael S. Branicky, Apr 09 2024
STATUS
approved