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.

A256596 a(n) is the number of iterations of the map x->sigma(x) when starting from n before arriving at a number with more than one ancestor, with a(1)=0 and where sigma is the sum of divisors.

Table of values

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

List of values

[0, 6, 5, 4, 2, 1, 3, 2, 3, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 4, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1]