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.

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.

Table of values

n a(n)
2 128
3 81
4 64
5 56
6 50
7 46
8 43
9 41
10 39
11 38
12 36
13 35
14 34
15 33
16 32
17 32
18 31
19 31
20 30
21 30
22 29
23 29
24 28
25 28
26 28
27 27
28 27
29 27
30 27
31 26
32 26
33 26
34 26
35 25
36 25
37 25
38 25
39 25
40 25
41 24
42 24
43 24
44 24
45 24
46 24
47 24
48 23
49 23
50 23
51 23
52 23
53 23
54 23
55 23
56 23
57 22
58 22
59 22
60 22
61 22
62 22
63 22
64 22
65 22
66 22
67 22
68 22
69 21

List of values

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