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.

A370809 Greatest number of multisets that can be obtained by choosing a prime factor of each part of an integer partition of n.

Table of values

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

List of values

[1, 0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 2, 3, 3, 4, 3, 4, 4, 4, 4, 6, 4, 6, 6, 6, 6, 8, 6, 8, 8, 9, 8, 10, 9, 12, 10, 12, 12, 12, 12, 16, 13, 16, 16, 18, 16, 20, 18, 20, 20, 24, 20, 24, 24, 24, 26, 30, 26, 30, 30, 32, 32, 36, 32, 36, 36, 40, 38, 42, 40, 45, 44, 48]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.