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.

A337474 Number of prime shifts (x -> A003961(x)) needed before the result is deficient, when starting from x = A108951(n), the primorial inflation of n.

Table of values

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

List of values

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