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.

A333262 Number of steps to reach 1 by iterating the alternating sum of divisors function A071324 starting from n.

Table of values

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

List of values

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

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

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