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.

A377511 a(n) = number of iterations of x -> 2 x + 7 to reach a nonprime, starting with prime(n).

Table of values

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

List of values

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