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.

A198724 Let P(n) be the maximal prime divisor of 3*n+1. Then a(n) is the smallest number of iterations of P(n) such that the a(n)-th iteration < n, and a(n) = 0, if such number does not exist.

Table of values

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

List of values

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