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.

A342679 Number of steps for n to reach 1 or n by repeated application of A037916, or -1 if they are never reached.

Table of values

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

List of values

[1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 4, 1, 3, 2, 2, 1, 2, 2, 2, 2, 3, 1, 3, 1, 2, 2, 2, 2, 3, 1, 2, 2, 2, 1, 3, 1, 3, 3, 2, 1, 2, 2, 4, 2, 3, 1, 2, 2, 2, 2, 2, 1, 2, 1, 2, 3, 3, 2, 3, 1, 3, 2, 3, 1, 3, 1, 2, 4, 3, 2, 3, 1, 2, 3, 2, 1, 2, 2, 2, 2, 2, 1]

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

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