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”).
%I #5 Aug 09 2020 00:33:58
%S 1024,647,512,442,397,365,342,324,309,297,286,277,269,263,256,251,246,
%T 242,237,234,230,227,224,221,218,216,214,211,209,207,205,203,202,200,
%U 199,197,196,194,193,192,190,189,188,187,186,185,184,183,182,181,180,179,178
%N 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 See A336774 for more information and links.
%C The overflow usually raises the corresponding exception, with +infinity returned as result.
%H Hugo Pfoertner, <a href="/A336780/a336780.txt">Comparison with 128-bit results</a>, range n=2..128, computed on x86-64 architecture.
%Y Cf. A336774, A336775, A336776, A336777, A336778, A336779, A336781.
%K nonn,fini
%O 2,1
%A _Hugo Pfoertner_, Aug 07 2020