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 A337068 #20 Aug 02 2025 21:55:34 %S A337068 129,81,65,56,50,46,43,41,39,38,36,35,34,33,33,32,31,31,30,30,29,29, %T A337068 28,28,28,27,27,27,27,26,26,26,26,25,25,25,25,25,25,24,24,24,24,24,24, %U A337068 24,23,23,23,23,23,23,23,23,23,22,22,22,22,22,22,22,22,22,22,22 %N A337068 a(n) is the least number of repetitions such that the result of the repeated execution of the division f <- f/n started at f=1 produces 0, when the division is performed using Commodore BASIC. %C A337068 A floating point number in Commodore BASIC has five bytes: one bit for the sign, 31 bits for the mantissa, eight bits for the exponent. %H A337068 C64 Wiki, <a href="https://www.c64-wiki.com/wiki/Floating_point_arithmetic">Floating point arithmetic</a> %H A337068 Markus Sigg, <a href="/A337068/a337068.jpg">Initial terms, displayed on original Commodore 2001 hardware</a>. %H A337068 Markus Sigg, <a href="/A337068/a337068.png">Screenshot of the program running on a PET 2001 emulated with MAME.</a> %H A337068 Wikipedia, <a href="https://en.wikipedia.org/wiki/Commodore_BASIC">Commodore BASIC</a> %o A337068 (BASIC) %o A337068 10 FOR N=2 TO 66 %o A337068 20 A=1 %o A337068 30 I=1 %o A337068 40 A=A/N %o A337068 50 IF A>0 THEN I=I+1:GOTO 40 %o A337068 60 PRINT I; %o A337068 70 NEXT %Y A337068 Cf. A336777, A336781. %K A337068 nonn,fini %O A337068 2,1 %A A337068 _Markus Sigg_, Aug 13 2020