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.

A385904 a(n) is the number of nonempty subsets of the divisors of n that sum to a perfect square.

Table of values

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

List of values

[1, 1, 2, 2, 1, 4, 1, 3, 3, 2, 1, 11, 1, 3, 4, 5, 1, 9, 1, 9, 3, 3, 1, 27, 2, 2, 4, 8, 1, 27, 1, 7, 3, 2, 2, 49, 1, 1, 3, 22, 1, 21, 1, 7, 8, 3, 1, 77, 2, 5, 2, 4, 1, 22, 2, 21, 2, 1, 1, 248, 1, 2, 7, 11, 1, 21, 1, 4, 2, 17, 1, 235, 1, 1, 9, 7, 1, 20, 1, 64, 6, 1]