This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A336780 #5 Aug 09 2020 00:33:58 %S A336780 1024,647,512,442,397,365,342,324,309,297,286,277,269,263,256,251,246, %T A336780 242,237,234,230,227,224,221,218,216,214,211,209,207,205,203,202,200, %U A336780 199,197,196,194,193,192,190,189,188,187,186,185,184,183,182,181,180,179,178 %N A336780 a(n) is the least number of repetitions such that the result of the repeated execution of the multiplication f <- f*n started at f=1 produces an overflow, when the multiplication is performed using 64-bit double precision floats according to the IEEE 754 standard. %C A336780 See A336774 for more information and links. %C A336780 The overflow usually raises the corresponding exception, with +infinity returned as result. %H A336780 Hugo Pfoertner, <a href="/A336780/a336780.txt">Comparison with 128-bit results</a>, range n=2..128, computed on x86-64 architecture. %Y A336780 Cf. A336774, A336775, A336776, A336777, A336778, A336779, A336781. %K A336780 nonn,fini %O A336780 2,1 %A A336780 _Hugo Pfoertner_, Aug 07 2020