login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
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
Wikipedia, Commodore BASIC
PROG
(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
CROSSREFS
Sequence in context: A034062 A241311 A252716 * A298720 A025332 A025324
KEYWORD
nonn,fini
AUTHOR
Markus Sigg, Aug 13 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:02 EDT 2024. Contains 371969 sequences. (Running on oeis4.)