cp's OEIS Frontend

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.

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.

Original entry on oeis.org

129, 81, 65, 56, 50, 46, 43, 41, 39, 38, 36, 35, 34, 33, 33, 32, 31, 31, 30, 30, 29, 29, 28, 28, 28, 27, 27, 27, 27, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22
Offset: 2

Views

Author

Markus Sigg, Aug 13 2020

Keywords

Comments

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.

Crossrefs

Programs

  • BASIC
    10 FOR N=2 TO 66
    20 A=1
    30 I=1
    40 A=A/N
    50 IF A>0 THEN I=I+1:GOTO 40
    60 PRINT I;
    70 NEXT