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.

A377610 a(n) is the number of iterations of x -> 2*x - 3 until (# composites reached) = (# primes reached), starting with prime(n+2).

Table of values

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

List of values

[13, 9, 7, 21, 7, 1, 15, 1, 5, 23, 5, 13, 1, 3, 1, 1, 3, 19, 1, 1, 11, 1, 7, 9, 1, 19, 1, 17, 7, 1, 3, 1, 1, 1, 11, 1, 5, 1, 1, 11, 3, 5, 1, 1, 15, 15, 1, 1, 3, 1, 5, 5, 1, 5, 1, 1, 1, 1, 13, 1, 1, 9, 1, 5, 3, 1, 3, 1, 1, 1, 1, 23, 1, 1, 1, 1, 1, 1, 1, 9, 3]