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.

A320105 If A001222(n) <= 2, a(n) = 1, otherwise, a(n) = Sum_{p|n} Sum_{q|n, q>=(p+[p^2 does not divide n])} a(prime(primepi(p)*primepi(q)) * (n/(p*q))), where p and q range over distinct primes dividing n. (See formula section for exact details.)

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 6, 1, 1, 1, 4, 1, 3, 1, 2, 2, 1, 1, 8, 1, 2, 1, 2, 1, 4, 1, 4, 1, 1, 1, 11, 1, 1, 2, 1, 1, 3, 1, 2, 1, 3, 1, 16, 1, 1, 2, 2, 1, 3, 1, 8, 2, 1, 1, 11, 1, 1, 1, 4, 1, 10, 1, 2, 1, 1, 1, 16, 1, 2, 2, 6, 1, 3, 1, 4, 3]