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.

A327642 Number of partitions of n into divisors of n that are at most sqrt(n).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 3
5 1
6 4
7 1
8 5
9 4
10 6
11 1
12 19
13 1
14 8
15 6
16 25
17 1
18 37
19 1
20 36
21 8
22 12
23 1
24 169
25 6
26 14
27 10
28 64
29 1
30 247
31 1
32 81
33 12
34 18
35 8
36 1072
37 1
38 20
39 14
40 405
41 1
42 512
43 1
44 144
45 82
46 24
47 1
48 2825
49 8
50 146
51 18
52 196
53 1
54 1000
55 12
56 743
57 20
58 30
59 1
60 19858
61 1
62 32
63 112
64 969
65 14
66 1728
67 1
68 324
69 24
70 1105

List of values

[1, 1, 1, 1, 3, 1, 4, 1, 5, 4, 6, 1, 19, 1, 8, 6, 25, 1, 37, 1, 36, 8, 12, 1, 169, 6, 14, 10, 64, 1, 247, 1, 81, 12, 18, 8, 1072, 1, 20, 14, 405, 1, 512, 1, 144, 82, 24, 1, 2825, 8, 146, 18, 196, 1, 1000, 12, 743, 20, 30, 1, 19858, 1, 32, 112, 969, 14, 1728, 1, 324, 24, 1105]