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.

A323519 a(n) is the number of ways to fill a square matrix with the multiset of prime factors of n, if the number of prime factors (counted with multiplicity) is a perfect square, and a(n) = 0 otherwise.

Table of values

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

List of values

[1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 4, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 6, 1, 0, 0, 4, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 4, 0, 4, 0, 0, 1, 12, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 12, 0, 0]