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.

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

Table of values

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

List of values

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