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.

A078681 Start with n; iterate the process x -> ceiling(3x/2) until reach a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.

Table of values

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

List of values

[1, 1, 1, 53, 5, 52, 1, 4, 51, 2, 1, 3, 39, 50, 1, 162, 3, 2, 1, 38, 49, 4, 2, 161, 50, 2, 1, 52, 4, 37, 1, 48, 3, 13, 1, 160, 9, 49, 1, 8, 42, 51, 18, 3, 36, 8, 1, 47, 3, 2, 12, 35, 27, 159, 1, 8, 48, 2, 1, 7, 4, 41, 50, 16, 17, 2, 1, 35, 7, 13, 1, 46, 11, 2, 1, 3, 11, 34, 2, 26, 158, 7, 6, 7]