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.

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.

Table of values

n a(n)
2 1024
3 647
4 512
5 442
6 397
7 365
8 342
9 324
10 309
11 297
12 286
13 277
14 269
15 263
16 256
17 251
18 246
19 242
20 237
21 234
22 230
23 227
24 224
25 221
26 218
27 216
28 214
29 211
30 209
31 207
32 205
33 203
34 202
35 200
36 199
37 197
38 196
39 194
40 193
41 192
42 190
43 189
44 188
45 187
46 186
47 185
48 184
49 183
50 182
51 181
52 180
53 179
54 178

List of values

[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]