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.

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

Table of values

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

List of values

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