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 A336776 #5 Aug 09 2020 00:33:43 %S A336776 128,81,64,56,50,46,43,41,39,38,36,35,34,33,32,32,31,31,30,30,29,29, %T A336776 28,28,28,27,27,27,27,26,26,26,26,25,25,25,25,25,25,24,24,24,24,24,24, %U A336776 24,23,23,23,23,23,23,23,23,23,22,22,22,22,22,22,22,22,22,22,22,22,21 %N A336776 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 32-bit single precision floats according to the IEEE 754 standard. %C A336776 See A336774 for more information and links. %C A336776 The overflow usually raises the corresponding exception, with +infinity returned as result. %H A336776 Hugo Pfoertner, <a href="/A336776/a336776.txt">Comparison with 128-bit results</a>, range n=2..128, computed on x86-64 architecture. %Y A336776 Cf. A336774, A336775, A336777, A336778, A336779, A336780, A336781. %K A336776 nonn,fini %O A336776 2,1 %A A336776 _Hugo Pfoertner_, Aug 07 2020