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.

A083339 a(n) is the number of distinct prime factors of n that occur in partitions into two primes when n is even and into three primes when n is odd.

Table of values

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

List of values

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