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.

A340683 a(n) = A007949((A003961(A003961(n))+1)/2), where A003961 shifts the prime factorization of n one step towards larger primes, and A007949(x) gives the exponent of largest power of 3 dividing x.

Table of values

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

List of values

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