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.

A232753 a(n) = the number of times needed to iterate Hofstadter's A030124, starting from A030124(1)=2, that the result were >= n; a(n) = the least k such that A232739(k) >= n.

Table of values

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

List of values

[1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14]

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

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