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.

A387327 Number of ways to choose an integer partition of each prime factor of n (with multiplicity).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 7
6 6
7 15
8 8
9 9
10 14
11 56
12 12
13 101
14 30
15 21
16 16
17 297
18 18
19 490
20 28
21 45
22 112
23 1255
24 24
25 49
26 202
27 27
28 60
29 4565
30 42
31 6842
32 32
33 168
34 594
35 105
36 36
37 21637
38 980
39 303
40 56
41 44583
42 90
43 63261
44 224
45 63
46 2510
47 124754
48 48
49 225
50 98
51 891
52 404
53 329931
54 54
55 392
56 120

List of values

[1, 2, 3, 4, 7, 6, 15, 8, 9, 14, 56, 12, 101, 30, 21, 16, 297, 18, 490, 28, 45, 112, 1255, 24, 49, 202, 27, 60, 4565, 42, 6842, 32, 168, 594, 105, 36, 21637, 980, 303, 56, 44583, 90, 63261, 224, 63, 2510, 124754, 48, 225, 98, 891, 404, 329931, 54, 392, 120]