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.

Showing 1-4 of 4 results.

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.

Original entry on oeis.org

128, 81, 64, 56, 50, 46, 43, 41, 39, 38, 36, 35, 34, 33, 32, 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, 22, 21
Offset: 2

Views

Author

Hugo Pfoertner, Aug 07 2020

Keywords

Comments

See A336774 for more information and links.
The overflow usually raises the corresponding exception, with +infinity returned as result.

Links

Crossrefs

Cf. A336774, A336775, A336777, A336778, A336779, A336780, A336781.

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.

Original entry on oeis.org

1024, 647, 512, 442, 397, 365, 342, 324, 309, 297, 286, 277, 269, 263, 256, 251, 246, 242, 237, 234, 230, 227, 224, 221, 218, 216, 214, 211, 209, 207, 205, 203, 202, 200, 199, 197, 196, 194, 193, 192, 190, 189, 188, 187, 186, 185, 184, 183, 182, 181, 180, 179, 178
Offset: 2

Views

Author

Hugo Pfoertner, Aug 07 2020

Keywords

Comments

See A336774 for more information and links.
The overflow usually raises the corresponding exception, with +infinity returned as result.

Links

Crossrefs

Cf. A336774, A336775, A336776, A336777, A336778, A336779, A336781.

A336781 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 64-bit double precision floats according to the IEEE 754 standard.

Original entry on oeis.org

1076, 680, 539, 464, 417, 384, 360, 341, 325, 312, 301, 292, 284, 277, 270, 264, 259, 255, 250, 246, 243, 239, 236, 233, 230, 228, 225, 223, 221, 218, 216, 215, 213, 211, 209, 208, 206, 205, 203, 202, 201, 200, 198, 197, 196, 195, 194, 193, 192, 191, 190, 189, 188
Offset: 2

Views

Author

Hugo Pfoertner, Aug 07 2020

Keywords

Comments

See A336777 and A336774 for more information and links.

Links

Crossrefs

Cf. A336774, A336775, A336776, A336777, A336778, A336779, A336780.

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.

Links

Crossrefs

Cf. A336777, A336781.

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
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.