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.

A349670 Number of iterations x -> (x-1)/2 needed to get 1, 2 or a composite number, when starting with prime(n).

Table of values

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

List of values

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