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.

A075522 Number of steps to reach the first nonprime (=A075523(n)) starting with the n-th prime p and iterating the map k -> 4*k+(p mod 4), or -1 if no integer is ever reached.

Table of values

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

List of values

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