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.

A084923 Consider the sequence b(1) = n, b(k) is the greatest prime factor of 3*b(k-1)+2. It is conjectured that this always becomes cyclic; a(n) = length of cycle (or 0 if no cycle is reached).

Table of values

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

List of values

[20, 1, 22, 21, 19, 20, 20, 20, 27, 2, 21, 25, 19, 22, 21, 20, 19, 21, 24, 26, 20, 20, 19, 28, 22, 20, 20, 20, 26, 20, 25, 21, 30, 20, 26, 22, 27, 27, 20, 29, 19, 2, 19, 28, 25, 21, 20, 21, 22, 25, 26, 20, 19, 20, 6, 20, 31, 22, 23, 20, 28, 21, 21, 23, 27, 20, 27, 22, 25, 20, 19, 22]

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

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